Theorem List for Intuitionistic Logic Explorer - 5101-5200 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | feq23 5101 |
Equality theorem for functions. (Contributed by FL, 14-Jul-2007.) (Proof
shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) |
|
Theorem | feq1d 5102 |
Equality deduction for functions. (Contributed by NM, 19-Feb-2008.)
|
⊢ (𝜑 → 𝐹 = 𝐺) ⇒ ⊢ (𝜑 → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵)) |
|
Theorem | feq2d 5103 |
Equality deduction for functions. (Contributed by Paul Chapman,
22-Jun-2011.)
|
⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐹:𝐴⟶𝐶 ↔ 𝐹:𝐵⟶𝐶)) |
|
Theorem | feq12d 5104 |
Equality deduction for functions. (Contributed by Paul Chapman,
22-Jun-2011.)
|
⊢ (𝜑 → 𝐹 = 𝐺)
& ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐹:𝐴⟶𝐶 ↔ 𝐺:𝐵⟶𝐶)) |
|
Theorem | feq123d 5105 |
Equality deduction for functions. (Contributed by Paul Chapman,
22-Jun-2011.)
|
⊢ (𝜑 → 𝐹 = 𝐺)
& ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐹:𝐴⟶𝐶 ↔ 𝐺:𝐵⟶𝐷)) |
|
Theorem | feq123 5106 |
Equality theorem for functions. (Contributed by FL, 16-Nov-2008.)
|
⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐶⟶𝐷)) |
|
Theorem | feq1i 5107 |
Equality inference for functions. (Contributed by Paul Chapman,
22-Jun-2011.)
|
⊢ 𝐹 = 𝐺 ⇒ ⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵) |
|
Theorem | feq2i 5108 |
Equality inference for functions. (Contributed by NM, 5-Sep-2011.)
|
⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐹:𝐴⟶𝐶 ↔ 𝐹:𝐵⟶𝐶) |
|
Theorem | feq23i 5109 |
Equality inference for functions. (Contributed by Paul Chapman,
22-Jun-2011.)
|
⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷) |
|
Theorem | feq23d 5110 |
Equality deduction for functions. (Contributed by NM, 8-Jun-2013.)
|
⊢ (𝜑 → 𝐴 = 𝐶)
& ⊢ (𝜑 → 𝐵 = 𝐷) ⇒ ⊢ (𝜑 → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) |
|
Theorem | nff 5111 |
Bound-variable hypothesis builder for a mapping. (Contributed by NM,
29-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
|
⊢ Ⅎ𝑥𝐹
& ⊢ Ⅎ𝑥𝐴
& ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐹:𝐴⟶𝐵 |
|
Theorem | sbcfng 5112* |
Distribute proper substitution through the function predicate with a
domain. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
|
⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴)) |
|
Theorem | sbcfg 5113* |
Distribute proper substitution through the function predicate with
domain and codomain. (Contributed by Alexander van der Vekens,
15-Jul-2018.)
|
⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹:𝐴⟶𝐵 ↔ ⦋𝑋 / 𝑥⦌𝐹:⦋𝑋 / 𝑥⦌𝐴⟶⦋𝑋 / 𝑥⦌𝐵)) |
|
Theorem | ffn 5114 |
A mapping is a function. (Contributed by NM, 2-Aug-1994.)
|
⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) |
|
Theorem | ffnd 5115 |
A mapping is a function with domain, deduction form. (Contributed by
Glauco Siliprandi, 17-Aug-2020.)
|
⊢ (𝜑 → 𝐹:𝐴⟶𝐵) ⇒ ⊢ (𝜑 → 𝐹 Fn 𝐴) |
|
Theorem | dffn2 5116 |
Any function is a mapping into V. (Contributed by NM,
31-Oct-1995.)
(Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V) |
|
Theorem | ffun 5117 |
A mapping is a function. (Contributed by NM, 3-Aug-1994.)
|
⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹) |
|
Theorem | frel 5118 |
A mapping is a relation. (Contributed by NM, 3-Aug-1994.)
|
⊢ (𝐹:𝐴⟶𝐵 → Rel 𝐹) |
|
Theorem | fdm 5119 |
The domain of a mapping. (Contributed by NM, 2-Aug-1994.)
|
⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) |
|
Theorem | fdmi 5120 |
The domain of a mapping. (Contributed by NM, 28-Jul-2008.)
|
⊢ 𝐹:𝐴⟶𝐵 ⇒ ⊢ dom 𝐹 = 𝐴 |
|
Theorem | frn 5121 |
The range of a mapping. (Contributed by NM, 3-Aug-1994.)
|
⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵) |
|
Theorem | dffn3 5122 |
A function maps to its range. (Contributed by NM, 1-Sep-1999.)
|
⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) |
|
Theorem | fss 5123 |
Expanding the codomain of a mapping. (Contributed by NM, 10-May-1998.)
(Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐹:𝐴⟶𝐶) |
|
Theorem | fssd 5124 |
Expanding the codomain of a mapping, deduction form. (Contributed by
Glauco Siliprandi, 11-Dec-2019.)
|
⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
& ⊢ (𝜑 → 𝐵 ⊆ 𝐶) ⇒ ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
|
Theorem | fco 5125 |
Composition of two mappings. (Contributed by NM, 29-Aug-1999.) (Proof
shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ ((𝐹:𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (𝐹 ∘ 𝐺):𝐴⟶𝐶) |
|
Theorem | fco2 5126 |
Functionality of a composition with weakened out of domain condition on
the first argument. (Contributed by Stefan O'Rear, 11-Mar-2015.)
|
⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (𝐹 ∘ 𝐺):𝐴⟶𝐶) |
|
Theorem | fssxp 5127 |
A mapping is a class of ordered pairs. (Contributed by NM, 3-Aug-1994.)
(Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) |
|
Theorem | fex2 5128 |
A function with bounded domain and range is a set. This version is proven
without the Axiom of Replacement. (Contributed by Mario Carneiro,
24-Jun-2015.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐹 ∈ V) |
|
Theorem | funssxp 5129 |
Two ways of specifying a partial function from 𝐴 to 𝐵.
(Contributed by NM, 13-Nov-2007.)
|
⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) ↔ (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
|
Theorem | ffdm 5130 |
A mapping is a partial function. (Contributed by NM, 25-Nov-2007.)
|
⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
|
Theorem | opelf 5131 |
The members of an ordered pair element of a mapping belong to the
mapping's domain and codomain. (Contributed by NM, 10-Dec-2003.)
(Revised by Mario Carneiro, 26-Apr-2015.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ 〈𝐶, 𝐷〉 ∈ 𝐹) → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) |
|
Theorem | fun 5132 |
The union of two functions with disjoint domains. (Contributed by NM,
22-Sep-2004.)
|
⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐷)) |
|
Theorem | fun2 5133 |
The union of two functions with disjoint domains. (Contributed by Mario
Carneiro, 12-Mar-2015.)
|
⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
|
Theorem | fnfco 5134 |
Composition of two functions. (Contributed by NM, 22-May-2006.)
|
⊢ ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐴) → (𝐹 ∘ 𝐺) Fn 𝐵) |
|
Theorem | fssres 5135 |
Restriction of a function with a subclass of its domain. (Contributed by
NM, 23-Sep-2004.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
|
Theorem | fssres2 5136 |
Restriction of a restricted function with a subclass of its domain.
(Contributed by NM, 21-Jul-2005.)
|
⊢ (((𝐹 ↾ 𝐴):𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
|
Theorem | fresin 5137 |
An identity for the mapping relationship under restriction. (Contributed
by Scott Fenton, 4-Sep-2011.) (Proof shortened by Mario Carneiro,
26-May-2016.)
|
⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵) |
|
Theorem | resasplitss 5138 |
If two functions agree on their common domain, their union contains a
union of three functions with pairwise disjoint domains. If we assumed
the law of the excluded middle, this would be equality rather than subset.
(Contributed by Jim Kingdon, 28-Dec-2018.)
|
⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ↾ (𝐴 ∩ 𝐵)) ∪ ((𝐹 ↾ (𝐴 ∖ 𝐵)) ∪ (𝐺 ↾ (𝐵 ∖ 𝐴)))) ⊆ (𝐹 ∪ 𝐺)) |
|
Theorem | fcoi1 5139 |
Composition of a mapping and restricted identity. (Contributed by NM,
13-Dec-2003.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹) |
|
Theorem | fcoi2 5140 |
Composition of restricted identity and a mapping. (Contributed by NM,
13-Dec-2003.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ (𝐹:𝐴⟶𝐵 → (( I ↾ 𝐵) ∘ 𝐹) = 𝐹) |
|
Theorem | feu 5141* |
There is exactly one value of a function in its codomain. (Contributed
by NM, 10-Dec-2003.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ∈ 𝐴) → ∃!𝑦 ∈ 𝐵 〈𝐶, 𝑦〉 ∈ 𝐹) |
|
Theorem | fcnvres 5142 |
The converse of a restriction of a function. (Contributed by NM,
26-Mar-1998.)
|
⊢ (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵)) |
|
Theorem | fimacnvdisj 5143 |
The preimage of a class disjoint with a mapping's codomain is empty.
(Contributed by FL, 24-Jan-2007.)
|
⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅) |
|
Theorem | fintm 5144* |
Function into an intersection. (Contributed by Jim Kingdon,
28-Dec-2018.)
|
⊢ ∃𝑥 𝑥 ∈ 𝐵 ⇒ ⊢ (𝐹:𝐴⟶∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐹:𝐴⟶𝑥) |
|
Theorem | fin 5145 |
Mapping into an intersection. (Contributed by NM, 14-Sep-1999.) (Proof
shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ (𝐹:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴⟶𝐶)) |
|
Theorem | fabexg 5146* |
Existence of a set of functions. (Contributed by Paul Chapman,
25-Feb-2008.)
|
⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⇒ ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V) |
|
Theorem | fabex 5147* |
Existence of a set of functions. (Contributed by NM, 3-Dec-2007.)
|
⊢ 𝐴 ∈ V & ⊢ 𝐵 ∈ V & ⊢ 𝐹 = {𝑥 ∣ (𝑥:𝐴⟶𝐵 ∧ 𝜑)} ⇒ ⊢ 𝐹 ∈ V |
|
Theorem | dmfex 5148 |
If a mapping is a set, its domain is a set. (Contributed by NM,
27-Aug-2006.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
|
⊢ ((𝐹 ∈ 𝐶 ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V) |
|
Theorem | f0 5149 |
The empty function. (Contributed by NM, 14-Aug-1999.)
|
⊢ ∅:∅⟶𝐴 |
|
Theorem | f00 5150 |
A class is a function with empty codomain iff it and its domain are empty.
(Contributed by NM, 10-Dec-2003.)
|
⊢ (𝐹:𝐴⟶∅ ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
|
Theorem | f0bi 5151 |
A function with empty domain is empty. (Contributed by Alexander van der
Vekens, 30-Jun-2018.)
|
⊢ (𝐹:∅⟶𝑋 ↔ 𝐹 = ∅) |
|
Theorem | f0dom0 5152 |
A function is empty iff it has an empty domain. (Contributed by AV,
10-Feb-2019.)
|
⊢ (𝐹:𝑋⟶𝑌 → (𝑋 = ∅ ↔ 𝐹 = ∅)) |
|
Theorem | f0rn0 5153* |
If there is no element in the range of a function, its domain must be
empty. (Contributed by Alexander van der Vekens, 12-Jul-2018.)
|
⊢ ((𝐸:𝑋⟶𝑌 ∧ ¬ ∃𝑦 ∈ 𝑌 𝑦 ∈ ran 𝐸) → 𝑋 = ∅) |
|
Theorem | fconst 5154 |
A cross product with a singleton is a constant function. (Contributed
by NM, 14-Aug-1999.) (Proof shortened by Andrew Salmon,
17-Sep-2011.)
|
⊢ 𝐵 ∈ V ⇒ ⊢ (𝐴 × {𝐵}):𝐴⟶{𝐵} |
|
Theorem | fconstg 5155 |
A cross product with a singleton is a constant function. (Contributed
by NM, 19-Oct-2004.)
|
⊢ (𝐵 ∈ 𝑉 → (𝐴 × {𝐵}):𝐴⟶{𝐵}) |
|
Theorem | fnconstg 5156 |
A cross product with a singleton is a constant function. (Contributed by
NM, 24-Jul-2014.)
|
⊢ (𝐵 ∈ 𝑉 → (𝐴 × {𝐵}) Fn 𝐴) |
|
Theorem | fconst6g 5157 |
Constant function with loose range. (Contributed by Stefan O'Rear,
1-Feb-2015.)
|
⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}):𝐴⟶𝐶) |
|
Theorem | fconst6 5158 |
A constant function as a mapping. (Contributed by Jeff Madsen,
30-Nov-2009.) (Revised by Mario Carneiro, 22-Apr-2015.)
|
⊢ 𝐵 ∈ 𝐶 ⇒ ⊢ (𝐴 × {𝐵}):𝐴⟶𝐶 |
|
Theorem | f1eq1 5159 |
Equality theorem for one-to-one functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1→𝐵 ↔ 𝐺:𝐴–1-1→𝐵)) |
|
Theorem | f1eq2 5160 |
Equality theorem for one-to-one functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐹:𝐵–1-1→𝐶)) |
|
Theorem | f1eq3 5161 |
Equality theorem for one-to-one functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1→𝐴 ↔ 𝐹:𝐶–1-1→𝐵)) |
|
Theorem | nff1 5162 |
Bound-variable hypothesis builder for a one-to-one function.
(Contributed by NM, 16-May-2004.)
|
⊢ Ⅎ𝑥𝐹
& ⊢ Ⅎ𝑥𝐴
& ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐹:𝐴–1-1→𝐵 |
|
Theorem | dff12 5163* |
Alternate definition of a one-to-one function. (Contributed by NM,
31-Dec-1996.)
|
⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
|
Theorem | f1f 5164 |
A one-to-one mapping is a mapping. (Contributed by NM, 31-Dec-1996.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) |
|
Theorem | f1rn 5165 |
The range of a one-to-one mapping. (Contributed by BJ, 6-Jul-2022.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → ran 𝐹 ⊆ 𝐵) |
|
Theorem | f1fn 5166 |
A one-to-one mapping is a function on its domain. (Contributed by NM,
8-Mar-2014.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴) |
|
Theorem | f1fun 5167 |
A one-to-one mapping is a function. (Contributed by NM, 8-Mar-2014.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹) |
|
Theorem | f1rel 5168 |
A one-to-one onto mapping is a relation. (Contributed by NM,
8-Mar-2014.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → Rel 𝐹) |
|
Theorem | f1dm 5169 |
The domain of a one-to-one mapping. (Contributed by NM, 8-Mar-2014.)
|
⊢ (𝐹:𝐴–1-1→𝐵 → dom 𝐹 = 𝐴) |
|
Theorem | f1ss 5170 |
A function that is one-to-one is also one-to-one on some superset of its
range. (Contributed by Mario Carneiro, 12-Jan-2013.)
|
⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶) |
|
Theorem | f1ssr 5171 |
Combine a one-to-one function with a restriction on the domain.
(Contributed by Stefan O'Rear, 20-Feb-2015.)
|
⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶) |
|
Theorem | f1ff1 5172 |
If a function is one-to-one from A to B and is also a function from A to
C, then it is a one-to-one function from A to C. (Contributed by BJ,
4-Jul-2022.)
|
⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴⟶𝐶) → 𝐹:𝐴–1-1→𝐶) |
|
Theorem | f1ssres 5173 |
A function that is one-to-one is also one-to-one on any subclass of its
domain. (Contributed by Mario Carneiro, 17-Jan-2015.)
|
⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
|
Theorem | f1resf1 5174 |
The restriction of an injective function is injective. (Contributed by
AV, 28-Jun-2022.)
|
⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) |
|
Theorem | f1cnvcnv 5175 |
Two ways to express that a set 𝐴 (not necessarily a function) is
one-to-one. Each side is equivalent to Definition 6.4(3) of
[TakeutiZaring] p. 24, who use the
notation "Un2 (A)" for one-to-one.
We
do not introduce a separate notation since we rarely use it. (Contributed
by NM, 13-Aug-2004.)
|
⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
|
Theorem | f1co 5176 |
Composition of one-to-one functions. Exercise 30 of [TakeutiZaring]
p. 25. (Contributed by NM, 28-May-1998.)
|
⊢ ((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) → (𝐹 ∘ 𝐺):𝐴–1-1→𝐶) |
|
Theorem | foeq1 5177 |
Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
|
⊢ (𝐹 = 𝐺 → (𝐹:𝐴–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵)) |
|
Theorem | foeq2 5178 |
Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐴–onto→𝐶 ↔ 𝐹:𝐵–onto→𝐶)) |
|
Theorem | foeq3 5179 |
Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐶–onto→𝐴 ↔ 𝐹:𝐶–onto→𝐵)) |
|
Theorem | nffo 5180 |
Bound-variable hypothesis builder for an onto function. (Contributed by
NM, 16-May-2004.)
|
⊢ Ⅎ𝑥𝐹
& ⊢ Ⅎ𝑥𝐴
& ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐹:𝐴–onto→𝐵 |
|
Theorem | fof 5181 |
An onto mapping is a mapping. (Contributed by NM, 3-Aug-1994.)
|
⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵) |
|
Theorem | fofun 5182 |
An onto mapping is a function. (Contributed by NM, 29-Mar-2008.)
|
⊢ (𝐹:𝐴–onto→𝐵 → Fun 𝐹) |
|
Theorem | fofn 5183 |
An onto mapping is a function on its domain. (Contributed by NM,
16-Dec-2008.)
|
⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴) |
|
Theorem | forn 5184 |
The codomain of an onto function is its range. (Contributed by NM,
3-Aug-1994.)
|
⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵) |
|
Theorem | dffo2 5185 |
Alternate definition of an onto function. (Contributed by NM,
22-Mar-2006.)
|
⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵)) |
|
Theorem | foima 5186 |
The image of the domain of an onto function. (Contributed by NM,
29-Nov-2002.)
|
⊢ (𝐹:𝐴–onto→𝐵 → (𝐹 “ 𝐴) = 𝐵) |
|
Theorem | dffn4 5187 |
A function maps onto its range. (Contributed by NM, 10-May-1998.)
|
⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴–onto→ran 𝐹) |
|
Theorem | funforn 5188 |
A function maps its domain onto its range. (Contributed by NM,
23-Jul-2004.)
|
⊢ (Fun 𝐴 ↔ 𝐴:dom 𝐴–onto→ran 𝐴) |
|
Theorem | fodmrnu 5189 |
An onto function has unique domain and range. (Contributed by NM,
5-Nov-2006.)
|
⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐹:𝐶–onto→𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
|
Theorem | fores 5190 |
Restriction of a function. (Contributed by NM, 4-Mar-1997.)
|
⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴)) |
|
Theorem | foco 5191 |
Composition of onto functions. (Contributed by NM, 22-Mar-2006.)
|
⊢ ((𝐹:𝐵–onto→𝐶 ∧ 𝐺:𝐴–onto→𝐵) → (𝐹 ∘ 𝐺):𝐴–onto→𝐶) |
|
Theorem | f1oeq1 5192 |
Equality theorem for one-to-one onto functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1-onto→𝐵 ↔ 𝐺:𝐴–1-1-onto→𝐵)) |
|
Theorem | f1oeq2 5193 |
Equality theorem for one-to-one onto functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐴–1-1-onto→𝐶 ↔ 𝐹:𝐵–1-1-onto→𝐶)) |
|
Theorem | f1oeq3 5194 |
Equality theorem for one-to-one onto functions. (Contributed by NM,
10-Feb-1997.)
|
⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:𝐶–1-1-onto→𝐵)) |
|
Theorem | f1oeq23 5195 |
Equality theorem for one-to-one onto functions. (Contributed by FL,
14-Jul-2012.)
|
⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐹:𝐴–1-1-onto→𝐶 ↔ 𝐹:𝐵–1-1-onto→𝐷)) |
|
Theorem | f1eq123d 5196 |
Equality deduction for one-to-one functions. (Contributed by Mario
Carneiro, 27-Jan-2017.)
|
⊢ (𝜑 → 𝐹 = 𝐺)
& ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐷)) |
|
Theorem | foeq123d 5197 |
Equality deduction for onto functions. (Contributed by Mario Carneiro,
27-Jan-2017.)
|
⊢ (𝜑 → 𝐹 = 𝐺)
& ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐹:𝐴–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐷)) |
|
Theorem | f1oeq123d 5198 |
Equality deduction for one-to-one onto functions. (Contributed by Mario
Carneiro, 27-Jan-2017.)
|
⊢ (𝜑 → 𝐹 = 𝐺)
& ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐶 ↔ 𝐺:𝐵–1-1-onto→𝐷)) |
|
Theorem | nff1o 5199 |
Bound-variable hypothesis builder for a one-to-one onto function.
(Contributed by NM, 16-May-2004.)
|
⊢ Ⅎ𝑥𝐹
& ⊢ Ⅎ𝑥𝐴
& ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐹:𝐴–1-1-onto→𝐵 |
|
Theorem | f1of1 5200 |
A one-to-one onto mapping is a one-to-one mapping. (Contributed by NM,
12-Dec-2003.)
|
⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–1-1→𝐵) |