maps injectively onto

URNurn:iso:std:iso:80000:-2:ed-2:en:item:2-12.7

https://metanorma.github.io/isq-smart/math/part-2-12/t2-12.7
urn:iso:std:iso:80000:-2:ed-2:en:item:2-12.7

ISQ Identifiers

ISO

urn:iso:std:iso:80000:-2:ed-2:en:item:2-12.7

IEC

urn:iec:std:iec:80000-2:2019:::item:2-12.7

Designations

ENmaps injectively onto

FRest une application injective dans

Symbol

f : A ↣ B

Notation systems

AsciiMath

f: A >-> B

LaTeX

f : A \tinj B

Definition

$f$ maps $A$ injectively into $B$

$f$ est une application injective de $A$ dans $B$

$f : A \to B$ and for all $x, y \in A$

if $x \neq y$ then $f (x) \neq f (y)$ .

The function $f$ is then said to be injective or one-one.

$f : A \to B$ et pour tous les $x, y \in A$

si $x \neq y$ alors $f (x) \neq f (y)$ .

On dit alors que la fonction $f$ est injective.

A mathematical concept as defined in ISO/IEC 80000 Part 2.

isq:t2-12.7

Property	Value
rdf:type	isq:MathConcept smart:TermEntry
dcterms:identifier	2-12.7
skosxl:prefLabel	"maps injectively onto"@en
skosxl:altLabel	"f: A >-> B"@en
skos:definition	stem:[f] maps stem:[A] injectively into stem:[B]
skos:note	stem:[f: A -> B] and for all stem:[x, y in A] if stem:[x != y] then stem:[f(x) != f(y)]. The function stem:[f] is then…
smart:hasBindingnessType	bindingness-type:normative
dcterms:isPartOf	isq:part-2-12