P. 102 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 10101-10200   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	finacn 10101	Every set has finite choice sequences. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝐴 ∈ Fin → AC 𝐴 = V)
Theorem	acndom 10102	A set with long choice sequences also has shorter choice sequences, where "shorter" here means the new index set is dominated by the old index set. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝐴 ≼ 𝐵 → (𝑋 ∈ AC 𝐵 → 𝑋 ∈ AC 𝐴))
Theorem	acnnum 10103	A set 𝑋 which has choice sequences on it of length 𝒫 𝑋 is well-orderable (and hence has choice sequences of every length). (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝑋 ∈ AC 𝒫 𝑋 ↔ 𝑋 ∈ dom card)
Theorem	acnen 10104	The class of choice sets of length 𝐴 is a cardinal invariant. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝐴 ≈ 𝐵 → AC 𝐴 = AC 𝐵)
Theorem	acndom2 10105	A set smaller than one with choice sequences of length 𝐴 also has choice sequences of length 𝐴. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝑋 ≼ 𝑌 → (𝑌 ∈ AC 𝐴 → 𝑋 ∈ AC 𝐴))
Theorem	acnen2 10106	The class of sets with choice sequences of length 𝐴 is a cardinal invariant. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝑋 ≈ 𝑌 → (𝑋 ∈ AC 𝐴 ↔ 𝑌 ∈ AC 𝐴))
Theorem	fodomacn 10107	A version of fodom 10573 that doesn't require the Axiom of Choice ax-ac 10509. If 𝐴 has choice sequences of length 𝐵, then any surjection from 𝐴 to 𝐵 can be inverted to an injection the other way. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (𝐴 ∈ AC 𝐵 → (𝐹:𝐴–onto→𝐵 → 𝐵 ≼ 𝐴))
Theorem	fodomnum 10108	A version of fodom 10573 that doesn't require the Axiom of Choice ax-ac 10509. (Contributed by Mario Carneiro, 28-Feb-2013.) (Revised by Mario Carneiro, 28-Apr-2015.)
⊢ (𝐴 ∈ dom card → (𝐹:𝐴–onto→𝐵 → 𝐵 ≼ 𝐴))
Theorem	fonum 10109	A surjection maps numerable sets to numerable sets. (Contributed by Mario Carneiro, 30-Apr-2015.)
⊢ ((𝐴 ∈ dom card ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ∈ dom card)
Theorem	numwdom 10110	A surjection maps numerable sets to numerable sets. (Contributed by Mario Carneiro, 27-Aug-2015.)
⊢ ((𝐴 ∈ dom card ∧ 𝐵 ≼* 𝐴) → 𝐵 ∈ dom card)
Theorem	fodomfi2 10111	Onto functions define dominance when a finite number of choices need to be made. (Contributed by Stefan O'Rear, 28-Feb-2015.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ≼ 𝐴)
Theorem	wdomfil 10112	Weak dominance agrees with normal for finite left sets. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by Mario Carneiro, 5-May-2015.)
⊢ (𝑋 ∈ Fin → (𝑋 ≼* 𝑌 ↔ 𝑋 ≼ 𝑌))
Theorem	infpwfien 10113	Any infinite well-orderable set is equinumerous to its set of finite subsets. (Contributed by Mario Carneiro, 18-May-2015.)
⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝒫 𝐴 ∩ Fin) ≈ 𝐴)
Theorem	inffien 10114	The set of finite intersections of an infinite well-orderable set is equinumerous to the set itself. (Contributed by Mario Carneiro, 18-May-2015.)
⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (fi‘𝐴) ≈ 𝐴)
Theorem	wdomnumr 10115	Weak dominance agrees with normal for numerable right sets. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by Mario Carneiro, 5-May-2015.)
⊢ (𝐵 ∈ dom card → (𝐴 ≼* 𝐵 ↔ 𝐴 ≼ 𝐵))
Theorem	alephfnon 10116	The aleph function is a function on the class of ordinal numbers. (Contributed by NM, 21-Oct-2003.) (Revised by Mario Carneiro, 13-Sep-2013.)
⊢ ℵ Fn On
Theorem	aleph0 10117	The first infinite cardinal number, discovered by Georg Cantor in 1873, has the same size as the set of natural numbers ω (and under our particular definition is also equal to it). In the literature, the argument of the aleph function is often written as a subscript, and the first aleph is written ℵ0. Exercise 3 of [TakeutiZaring] p. 91. Also Definition 12(i) of [Suppes] p. 228. From Moshé Machover, Set Theory, Logic, and Their Limitations, p. 95: "Aleph ... the first letter in the Hebrew alphabet ... is also the first letter of the Hebrew word ... (einsoph, meaning infinity), which is a cabbalistic appellation of the deity. The notation is due to Cantor, who was deeply interested in mysticism." (Contributed by NM, 21-Oct-2003.) (Revised by Mario Carneiro, 13-Sep-2013.)
⊢ (ℵ‘∅) = ω
Theorem	alephlim 10118*	Value of the aleph function at a limit ordinal. Definition 12(iii) of [Suppes] p. 91. (Contributed by NM, 21-Oct-2003.) (Revised by Mario Carneiro, 13-Sep-2013.)
⊢ ((𝐴 ∈ 𝑉 ∧ Lim 𝐴) → (ℵ‘𝐴) = ∪ 𝑥 ∈ 𝐴 (ℵ‘𝑥))
Theorem	alephsuc 10119	Value of the aleph function at a successor ordinal. Definition 12(ii) of [Suppes] p. 91. Here we express the successor aleph in terms of the Hartogs function df-har 9529, which gives the smallest ordinal that strictly dominates its argument (or the supremum of all ordinals that are dominated by the argument). (Contributed by Mario Carneiro, 13-Sep-2013.) (Revised by Mario Carneiro, 15-May-2015.)
⊢ (𝐴 ∈ On → (ℵ‘suc 𝐴) = (har‘(ℵ‘𝐴)))
Theorem	alephon 10120	An aleph is an ordinal number. (Contributed by NM, 10-Nov-2003.) (Revised by Mario Carneiro, 13-Sep-2013.)
⊢ (ℵ‘𝐴) ∈ On
Theorem	alephcard 10121	Every aleph is a cardinal number. Theorem 65 of [Suppes] p. 229. (Contributed by NM, 25-Oct-2003.) (Revised by Mario Carneiro, 2-Feb-2013.)
⊢ (card‘(ℵ‘𝐴)) = (ℵ‘𝐴)
Theorem	alephnbtwn 10122	No cardinal can be sandwiched between an aleph and its successor aleph. Theorem 67 of [Suppes] p. 229. (Contributed by NM, 10-Nov-2003.) (Revised by Mario Carneiro, 15-May-2015.)
⊢ ((card‘𝐵) = 𝐵 → ¬ ((ℵ‘𝐴) ∈ 𝐵 ∧ 𝐵 ∈ (ℵ‘suc 𝐴)))
Theorem	alephnbtwn2 10123	No set has equinumerosity between an aleph and its successor aleph. (Contributed by NM, 3-Nov-2003.) (Revised by Mario Carneiro, 2-Feb-2013.)
⊢ ¬ ((ℵ‘𝐴) ≺ 𝐵 ∧ 𝐵 ≺ (ℵ‘suc 𝐴))
Theorem	alephordilem1 10124	Lemma for alephordi 10125. (Contributed by NM, 23-Oct-2009.) (Revised by Mario Carneiro, 15-May-2015.)
⊢ (𝐴 ∈ On → (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴))
Theorem	alephordi 10125	Strict ordering property of the aleph function. (Contributed by Mario Carneiro, 2-Feb-2013.)
⊢ (𝐵 ∈ On → (𝐴 ∈ 𝐵 → (ℵ‘𝐴) ≺ (ℵ‘𝐵)))
Theorem	alephord 10126	Ordering property of the aleph function. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 9-Feb-2013.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 ↔ (ℵ‘𝐴) ≺ (ℵ‘𝐵)))
Theorem	alephord2 10127	Ordering property of the aleph function. Theorem 8A(a) of [Enderton] p. 213 and its converse. (Contributed by NM, 3-Nov-2003.) (Revised by Mario Carneiro, 9-Feb-2013.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 ↔ (ℵ‘𝐴) ∈ (ℵ‘𝐵)))
Theorem	alephord2i 10128	Ordering property of the aleph function. Theorem 66 of [Suppes] p. 229. (Contributed by NM, 25-Oct-2003.)
⊢ (𝐵 ∈ On → (𝐴 ∈ 𝐵 → (ℵ‘𝐴) ∈ (ℵ‘𝐵)))
Theorem	alephord3 10129	Ordering property of the aleph function. (Contributed by NM, 11-Nov-2003.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (ℵ‘𝐴) ⊆ (ℵ‘𝐵)))
Theorem	alephsucdom 10130	A set dominated by an aleph is strictly dominated by its successor aleph and vice-versa. (Contributed by NM, 3-Nov-2003.) (Revised by Mario Carneiro, 2-Feb-2013.)
⊢ (𝐵 ∈ On → (𝐴 ≼ (ℵ‘𝐵) ↔ 𝐴 ≺ (ℵ‘suc 𝐵)))
Theorem	alephsuc2 10131*	An alternate representation of a successor aleph. The aleph function is the function obtained from the hartogs 9516 function by transfinite recursion, starting from ω. Using this theorem we could define the aleph function with {𝑧 ∈ On ∣ 𝑧 ≼ 𝑥} in place of ∩ {𝑧 ∈ On ∣ 𝑥 ≺ 𝑧} in df-aleph 9993. (Contributed by NM, 3-Nov-2003.) (Revised by Mario Carneiro, 2-Feb-2013.)
⊢ (𝐴 ∈ On → (ℵ‘suc 𝐴) = {𝑥 ∈ On ∣ 𝑥 ≼ (ℵ‘𝐴)})
Theorem	alephdom 10132	Relationship between inclusion of ordinal numbers and dominance of infinite initial ordinals. (Contributed by Jeff Hankins, 23-Oct-2009.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (ℵ‘𝐴) ≼ (ℵ‘𝐵)))
Theorem	alephgeom 10133	Every aleph is greater than or equal to the set of natural numbers. (Contributed by NM, 11-Nov-2003.)
⊢ (𝐴 ∈ On ↔ ω ⊆ (ℵ‘𝐴))
Theorem	alephislim 10134	Every aleph is a limit ordinal. (Contributed by NM, 11-Nov-2003.)
⊢ (𝐴 ∈ On ↔ Lim (ℵ‘𝐴))
Theorem	aleph11 10135	The aleph function is one-to-one. (Contributed by NM, 3-Aug-2004.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((ℵ‘𝐴) = (ℵ‘𝐵) ↔ 𝐴 = 𝐵))
Theorem	alephf1 10136	The aleph function is a one-to-one mapping from the ordinals to the infinite cardinals. See also alephf1ALT 10154. (Contributed by Mario Carneiro, 2-Feb-2013.)
⊢ ℵ:On–1-1→On
Theorem	alephsdom 10137	If an ordinal is smaller than an initial ordinal, it is strictly dominated by it. (Contributed by Jeff Hankins, 24-Oct-2009.) (Proof shortened by Mario Carneiro, 20-Sep-2014.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ (ℵ‘𝐵) ↔ 𝐴 ≺ (ℵ‘𝐵)))
Theorem	alephdom2 10138	A dominated initial ordinal is included. (Contributed by Jeff Hankins, 24-Oct-2009.)
⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((ℵ‘𝐴) ⊆ 𝐵 ↔ (ℵ‘𝐴) ≼ 𝐵))
Theorem	alephle 10139	The argument of the aleph function is less than or equal to its value. Exercise 2 of [TakeutiZaring] p. 91. (Later, in alephfp2 10160, we will that equality can sometimes hold.) (Contributed by NM, 9-Nov-2003.) (Proof shortened by Mario Carneiro, 22-Feb-2013.)
⊢ (𝐴 ∈ On → 𝐴 ⊆ (ℵ‘𝐴))
Theorem	cardaleph 10140*	Given any transfinite cardinal number 𝐴, there is exactly one aleph that is equal to it. Here we compute that aleph explicitly. (Contributed by NM, 9-Nov-2003.) (Revised by Mario Carneiro, 2-Feb-2013.)
⊢ ((ω ⊆ 𝐴 ∧ (card‘𝐴) = 𝐴) → 𝐴 = (ℵ‘∩ {𝑥 ∈ On ∣ 𝐴 ⊆ (ℵ‘𝑥)}))
Theorem	cardalephex 10141*	Every transfinite cardinal is an aleph and vice-versa. Theorem 8A(b) of [Enderton] p. 213 and its converse. (Contributed by NM, 5-Nov-2003.)
⊢ (ω ⊆ 𝐴 → ((card‘𝐴) = 𝐴 ↔ ∃𝑥 ∈ On 𝐴 = (ℵ‘𝑥)))
Theorem	infenaleph 10142*	An infinite numerable set is equinumerous to an infinite initial ordinal. (Contributed by Jeff Hankins, 23-Oct-2009.) (Revised by Mario Carneiro, 29-Apr-2015.)
⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → ∃𝑥 ∈ ran ℵ𝑥 ≈ 𝐴)
Theorem	isinfcard 10143	Two ways to express the property of being a transfinite cardinal. (Contributed by NM, 9-Nov-2003.)
⊢ ((ω ⊆ 𝐴 ∧ (card‘𝐴) = 𝐴) ↔ 𝐴 ∈ ran ℵ)
Theorem	iscard3 10144	Two ways to express the property of being a cardinal number. (Contributed by NM, 9-Nov-2003.)
⊢ ((card‘𝐴) = 𝐴 ↔ 𝐴 ∈ (ω ∪ ran ℵ))
Theorem	cardnum 10145	Two ways to express the class of all cardinal numbers, which consists of the finite ordinals in ω plus the transfinite alephs. (Contributed by NM, 10-Sep-2004.)
⊢ {𝑥 ∣ (card‘𝑥) = 𝑥} = (ω ∪ ran ℵ)
Theorem	alephinit 10146*	An infinite initial ordinal is characterized by the property of being initial - that is, it is a subset of any dominating ordinal. (Contributed by Jeff Hankins, 29-Oct-2009.) (Proof shortened by Mario Carneiro, 20-Sep-2014.)
⊢ ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → (𝐴 ∈ ran ℵ ↔ ∀𝑥 ∈ On (𝐴 ≼ 𝑥 → 𝐴 ⊆ 𝑥)))
Theorem	carduniima 10147	The union of the image of a mapping to cardinals is a cardinal. Proposition 11.16 of [TakeutiZaring] p. 104. (Contributed by NM, 4-Nov-2004.)
⊢ (𝐴 ∈ 𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → ∪ (𝐹 “ 𝐴) ∈ (ω ∪ ran ℵ)))
Theorem	cardinfima 10148*	If a mapping to cardinals has an infinite value, then the union of its image is an infinite cardinal. Corollary 11.17 of [TakeutiZaring] p. 104. (Contributed by NM, 4-Nov-2004.)
⊢ (𝐴 ∈ 𝐵 → ((𝐹:𝐴⟶(ω ∪ ran ℵ) ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ ran ℵ) → ∪ (𝐹 “ 𝐴) ∈ ran ℵ))
Theorem	alephiso 10149	Aleph is an order isomorphism of the class of ordinal numbers onto the class of infinite cardinals. Definition 10.27 of [TakeutiZaring] p. 90. (Contributed by NM, 3-Aug-2004.)
⊢ ℵ Isom E , E (On, {𝑥 ∣ (ω ⊆ 𝑥 ∧ (card‘𝑥) = 𝑥)})
Theorem	alephprc 10150	The class of all transfinite cardinal numbers (the range of the aleph function) is a proper class. Proposition 10.26 of [TakeutiZaring] p. 90. (Contributed by NM, 11-Nov-2003.)
⊢ ¬ ran ℵ ∈ V
Theorem	alephsson 10151	The class of transfinite cardinals (the range of the aleph function) is a subclass of the class of ordinal numbers. (Contributed by NM, 11-Nov-2003.)
⊢ ran ℵ ⊆ On
Theorem	unialeph 10152	The union of the class of transfinite cardinals (the range of the aleph function) is the class of ordinal numbers. (Contributed by NM, 11-Nov-2003.)
⊢ ∪ ran ℵ = On
Theorem	alephsmo 10153	The aleph function is strictly monotone. (Contributed by Mario Carneiro, 15-Mar-2013.)
⊢ Smo ℵ
Theorem	alephf1ALT 10154	Alternate proof of alephf1 10136. (Contributed by Mario Carneiro, 15-Mar-2013.) (Proof modification is discouraged.) (New usage is discouraged.)
⊢ ℵ:On–1-1→On
Theorem	alephfplem1 10155	Lemma for alephfp 10159. (Contributed by NM, 6-Nov-2004.)
⊢ 𝐻 = (rec(ℵ, ω) ↾ ω)    ⇒   ⊢ (𝐻‘∅) ∈ ran ℵ
Theorem	alephfplem2 10156*	Lemma for alephfp 10159. (Contributed by NM, 6-Nov-2004.)
⊢ 𝐻 = (rec(ℵ, ω) ↾ ω)    ⇒   ⊢ (𝑤 ∈ ω → (𝐻‘suc 𝑤) = (ℵ‘(𝐻‘𝑤)))
Theorem	alephfplem3 10157*	Lemma for alephfp 10159. (Contributed by NM, 6-Nov-2004.)
⊢ 𝐻 = (rec(ℵ, ω) ↾ ω)    ⇒   ⊢ (𝑣 ∈ ω → (𝐻‘𝑣) ∈ ran ℵ)
Theorem	alephfplem4 10158	Lemma for alephfp 10159. (Contributed by NM, 5-Nov-2004.)
⊢ 𝐻 = (rec(ℵ, ω) ↾ ω)    ⇒   ⊢ ∪ (𝐻 “ ω) ∈ ran ℵ
Theorem	alephfp 10159	The aleph function has a fixed point. Similar to Proposition 11.18 of [TakeutiZaring] p. 104, except that we construct an actual example of a fixed point rather than just showing its existence. See alephfp2 10160 for an abbreviated version just showing existence. (Contributed by NM, 6-Nov-2004.) (Proof shortened by Mario Carneiro, 15-May-2015.)
⊢ 𝐻 = (rec(ℵ, ω) ↾ ω)    ⇒   ⊢ (ℵ‘∪ (𝐻 “ ω)) = ∪ (𝐻 “ ω)
Theorem	alephfp2 10160	The aleph function has at least one fixed point. Proposition 11.18 of [TakeutiZaring] p. 104. See alephfp 10159 for an actual example of a fixed point. Compare the inequality alephle 10139 that holds in general. Note that if 𝑥 is a fixed point, then ℵ‘ℵ‘ℵ‘... ℵ‘𝑥 = 𝑥. (Contributed by NM, 6-Nov-2004.) (Revised by Mario Carneiro, 15-May-2015.)
⊢ ∃𝑥 ∈ On (ℵ‘𝑥) = 𝑥
Theorem	alephval3 10161*	An alternate way to express the value of the aleph function: it is the least infinite cardinal different from all values at smaller arguments. Definition of aleph in [Enderton] p. 212 and definition of aleph in [BellMachover] p. 490 . (Contributed by NM, 16-Nov-2003.)
⊢ (𝐴 ∈ On → (ℵ‘𝐴) = ∩ {𝑥 ∣ ((card‘𝑥) = 𝑥 ∧ ω ⊆ 𝑥 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑥 = (ℵ‘𝑦))})
Theorem	alephsucpw2 10162	The power set of an aleph is not strictly dominated by the successor aleph. (The Generalized Continuum Hypothesis says they are equinumerous, see gch3 10733 or gchaleph2 10729.) The transposed form alephsucpw 10627 cannot be proven without the AC, and is in fact equivalent to it. (Contributed by Mario Carneiro, 2-Feb-2013.)
⊢ ¬ 𝒫 (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴)
Theorem	mappwen 10163	Power rule for cardinal arithmetic. Theorem 11.21 of [TakeutiZaring] p. 106. (Contributed by Mario Carneiro, 9-Mar-2013.) (Revised by Mario Carneiro, 27-Apr-2015.)
⊢ (((𝐵 ∈ dom card ∧ ω ≼ 𝐵) ∧ (2o ≼ 𝐴 ∧ 𝐴 ≼ 𝒫 𝐵)) → (𝐴 ↑m 𝐵) ≈ 𝒫 𝐵)
Theorem	finnisoeu 10164*	A finite totally ordered set has a unique order isomorphism to a finite ordinal. (Contributed by Stefan O'Rear, 16-Nov-2014.) (Proof shortened by Mario Carneiro, 26-Jun-2015.)
⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ∃!𝑓 𝑓 Isom E , 𝑅 ((card‘𝐴), 𝐴))
Theorem	iunfictbso 10165	Countability of a countable union of finite sets with a strict (not globally well) order fulfilling the choice role. (Contributed by Stefan O'Rear, 16-Nov-2014.)
⊢ ((𝐴 ≼ ω ∧ 𝐴 ⊆ Fin ∧ 𝐵 Or ∪ 𝐴) → ∪ 𝐴 ≼ ω)
2.6.15  Axiom of Choice equivalents
Syntax	wac 10166	Wff for an abbreviation of the axiom of choice.
wff CHOICE
Definition	df-ac 10167*	The expression CHOICE will be used as a readable shorthand for any form of the axiom of choice; all concrete forms are long, cryptic, have dummy variables, or all three, making it useful to have a short name. Similar to the Axiom of Choice (first form) of [Enderton] p. 49. There is a slight problem with taking the exact form of ax-ac 10509 as our definition, because the equivalence to more standard forms (dfac2 10182) requires the Axiom of Regularity, which we often try to avoid. Thus, we take the first of the "textbook forms" as the definition and derive the form of ax-ac 10509 itself as dfac0 10184. (Contributed by Mario Carneiro, 22-Feb-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑓(𝑓 ⊆ 𝑥 ∧ 𝑓 Fn dom 𝑥))
Theorem	aceq1 10168*	Equivalence of two versions of the Axiom of Choice ax-ac 10509. The proof uses neither AC nor the Axiom of Regularity. The right-hand side expresses our AC with the fewest number of different variables. (Contributed by NM, 5-Apr-2004.)
⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑥∀𝑧(∃𝑥((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) ∧ (𝑧 ∈ 𝑥 ∧ 𝑥 ∈ 𝑦)) ↔ 𝑧 = 𝑥)))
Theorem	aceq0 10169*	Equivalence of two versions of the Axiom of Choice. The proof uses neither AC nor the Axiom of Regularity. The right-hand side is our original ax-ac 10509. (Contributed by NM, 5-Apr-2004.)
⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑣∀𝑢(∃𝑡((𝑢 ∈ 𝑤 ∧ 𝑤 ∈ 𝑡) ∧ (𝑢 ∈ 𝑡 ∧ 𝑡 ∈ 𝑦)) ↔ 𝑢 = 𝑣)))
Theorem	aceq2 10170*	Equivalence of two versions of the Axiom of Choice. The proof uses neither AC nor the Axiom of Regularity. (Contributed by NM, 5-Apr-2004.)
⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))
Theorem	aceq3lem 10171*	Lemma for dfac3 10172. (Contributed by NM, 2-Apr-2004.) (Revised by Mario Carneiro, 26-Jun-2015.)
⊢ 𝐹 = (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))    ⇒   ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))
Theorem	dfac3 10172*	Equivalence of two versions of the Axiom of Choice. The left-hand side is defined as the Axiom of Choice (first form) of [Enderton] p. 49. The right-hand side is the Axiom of Choice of [TakeutiZaring] p. 83. The proof does not depend on AC. (Contributed by NM, 24-Mar-2004.) (Revised by Stefan O'Rear, 22-Feb-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
Theorem	dfac4 10173*	Equivalence of two versions of the Axiom of Choice. The right-hand side is Axiom AC of [BellMachover] p. 488. The proof does not depend on AC. (Contributed by NM, 24-Mar-2004.) (Revised by Mario Carneiro, 26-Jun-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)))
Theorem	dfac5lem1 10174*	Lemma for dfac5 10179. (Contributed by NM, 12-Apr-2004.)
⊢ (∃!𝑣 𝑣 ∈ (({𝑤} × 𝑤) ∩ 𝑦) ↔ ∃!𝑔(𝑔 ∈ 𝑤 ∧ ⟨𝑤, 𝑔⟩ ∈ 𝑦))
Theorem	dfac5lem2 10175*	Lemma for dfac5 10179. (Contributed by NM, 12-Apr-2004.)
⊢ 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 ∈ ℎ 𝑢 = ({𝑡} × 𝑡))}    ⇒   ⊢ (⟨𝑤, 𝑔⟩ ∈ ∪ 𝐴 ↔ (𝑤 ∈ ℎ ∧ 𝑔 ∈ 𝑤))
Theorem	dfac5lem3 10176*	Lemma for dfac5 10179. (Contributed by NM, 12-Apr-2004.)
⊢ 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 ∈ ℎ 𝑢 = ({𝑡} × 𝑡))}    ⇒   ⊢ (({𝑤} × 𝑤) ∈ 𝐴 ↔ (𝑤 ≠ ∅ ∧ 𝑤 ∈ ℎ))
Theorem	dfac5lem4 10177*	Lemma for dfac5 10179. (Contributed by NM, 11-Apr-2004.) Avoid ax-11 2194. (Revised by BTernaryTau, 23-Jun-2025.)
⊢ 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 ∈ ℎ 𝑢 = ({𝑡} × 𝑡))}    &   ⊢ (𝜑 ↔ ∀𝑥((∀𝑧 ∈ 𝑥 𝑧 ≠ ∅ ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ≠ 𝑤 → (𝑧 ∩ 𝑤) = ∅)) → ∃𝑦∀𝑧 ∈ 𝑥 ∃!𝑣 𝑣 ∈ (𝑧 ∩ 𝑦)))    ⇒   ⊢ (𝜑 → ∃𝑦∀𝑧 ∈ 𝐴 ∃!𝑣 𝑣 ∈ (𝑧 ∩ 𝑦))
Theorem	dfac5lem5 10178*	Lemma for dfac5 10179. (Contributed by NM, 12-Apr-2004.)
⊢ 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 ∈ ℎ 𝑢 = ({𝑡} × 𝑡))}    &   ⊢ (𝜑 ↔ ∀𝑥((∀𝑧 ∈ 𝑥 𝑧 ≠ ∅ ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ≠ 𝑤 → (𝑧 ∩ 𝑤) = ∅)) → ∃𝑦∀𝑧 ∈ 𝑥 ∃!𝑣 𝑣 ∈ (𝑧 ∩ 𝑦)))    &   ⊢ 𝐵 = (∪ 𝐴 ∩ 𝑦)    ⇒   ⊢ (𝜑 → ∃𝑓∀𝑤 ∈ ℎ (𝑤 ≠ ∅ → (𝑓‘𝑤) ∈ 𝑤))
Theorem	dfac5 10179*	Equivalence of two versions of the Axiom of Choice. The right-hand side is Theorem 6M(4) of [Enderton] p. 151 and asserts that given a family of mutually disjoint nonempty sets, a set exists containing exactly one member from each set in the family. The proof does not depend on AC. (Contributed by NM, 11-Apr-2004.) (Revised by Mario Carneiro, 17-May-2015.)
⊢ (CHOICE ↔ ∀𝑥((∀𝑧 ∈ 𝑥 𝑧 ≠ ∅ ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ≠ 𝑤 → (𝑧 ∩ 𝑤) = ∅)) → ∃𝑦∀𝑧 ∈ 𝑥 ∃!𝑣 𝑣 ∈ (𝑧 ∩ 𝑦)))
Theorem	dfac2a 10180*	Our Axiom of Choice (in the form of ac3 10512) implies the Axiom of Choice (first form) of [Enderton] p. 49. The proof uses neither AC nor the Axiom of Regularity. See dfac2b 10181 for the converse (which does use the Axiom of Regularity). (Contributed by NM, 5-Apr-2004.) (Revised by Mario Carneiro, 26-Jun-2015.)
⊢ (∀𝑥∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)) → CHOICE)
Theorem	dfac2b 10181*	Axiom of Choice (first form) of [Enderton] p. 49 implies our Axiom of Choice (in the form of ac3 10512). The proof does not make use of AC. Note that the Axiom of Regularity is used by the proof. Specifically, elneq 9573 and preleq 9595 that are referenced in the proof each make use of Regularity for their derivations. (The reverse implication can be derived without using Regularity; see dfac2a 10180.) (Contributed by NM, 5-Apr-2004.) (Revised by Mario Carneiro, 26-Jun-2015.) (Revised by AV, 16-Jun-2022.)
⊢ (CHOICE → ∀𝑥∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))
Theorem	dfac2 10182*	Axiom of Choice (first form) of [Enderton] p. 49 corresponds to our Axiom of Choice (in the form of ac3 10512). The proof does not make use of AC, but the Axiom of Regularity is used (by applying dfac2b 10181). (Contributed by NM, 5-Apr-2004.) (Revised by Mario Carneiro, 26-Jun-2015.) (Revised by AV, 16-Jun-2022.)
⊢ (CHOICE ↔ ∀𝑥∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))
Theorem	dfac7 10183*	Equivalence of the Axiom of Choice (first form) of [Enderton] p. 49 and our Axiom of Choice (in the form of ac2 10511). The proof does not depend on AC but does depend on the Axiom of Regularity. (Contributed by Mario Carneiro, 17-May-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
Theorem	dfac0 10184*	Equivalence of two versions of the Axiom of Choice. The proof uses the Axiom of Regularity. The right-hand side is our original ax-ac 10509. (Contributed by Mario Carneiro, 17-May-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑣∀𝑢(∃𝑡((𝑢 ∈ 𝑤 ∧ 𝑤 ∈ 𝑡) ∧ (𝑢 ∈ 𝑡 ∧ 𝑡 ∈ 𝑦)) ↔ 𝑢 = 𝑣)))
Theorem	dfac1 10185*	Equivalence of two versions of the Axiom of Choice ax-ac 10509. The proof uses the Axiom of Regularity. The right-hand side expresses our AC with the fewest number of different variables. (Contributed by Mario Carneiro, 17-May-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑥∀𝑧(∃𝑥((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) ∧ (𝑧 ∈ 𝑥 ∧ 𝑥 ∈ 𝑦)) ↔ 𝑧 = 𝑥)))
Theorem	dfac8 10186*	A proof of the equivalency of the well-ordering theorem weth 10545 and the axiom of choice ac7 10523. (Contributed by Mario Carneiro, 5-Jan-2013.)
⊢ (CHOICE ↔ ∀𝑥∃𝑟 𝑟 We 𝑥)
Theorem	dfac9 10187*	Equivalence of the axiom of choice with a statement related to ac9 10533; definition AC3 of [Schechter] p. 139. (Contributed by Stefan O'Rear, 22-Feb-2015.)
⊢ (CHOICE ↔ ∀𝑓((Fun 𝑓 ∧ ∅ ∉ ran 𝑓) → X𝑥 ∈ dom 𝑓(𝑓‘𝑥) ≠ ∅))
Theorem	dfac10 10188	Axiom of Choice equivalent: the cardinality function measures every set. (Contributed by Mario Carneiro, 6-May-2015.)
⊢ (CHOICE ↔ dom card = V)
Theorem	dfac10c 10189*	Axiom of Choice equivalent: every set is equinumerous to an ordinal. (Contributed by Stefan O'Rear, 17-Jan-2015.)
⊢ (CHOICE ↔ ∀𝑥∃𝑦 ∈ On 𝑦 ≈ 𝑥)
Theorem	dfac10b 10190	Axiom of Choice equivalent: every set is equinumerous to an ordinal (quantifier-free short cryptic version alluded to in df-ac 10167). (Contributed by Stefan O'Rear, 17-Jan-2015.)
⊢ (CHOICE ↔ ( ≈ “ On) = V)
Theorem	acacni 10191	A choice equivalent: every set has choice sets of every length. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ ((CHOICE ∧ 𝐴 ∈ 𝑉) → AC 𝐴 = V)
Theorem	dfacacn 10192	A choice equivalent: every set has choice sets of every length. (Contributed by Mario Carneiro, 31-Aug-2015.)
⊢ (CHOICE ↔ ∀𝑥AC 𝑥 = V)
Theorem	dfac13 10193	The axiom of choice holds iff every set has choice sequences as long as itself. (Contributed by Mario Carneiro, 3-Sep-2015.)
⊢ (CHOICE ↔ ∀𝑥 𝑥 ∈ AC 𝑥)
Theorem	dfac12lem1 10194*	Lemma for dfac12 10200. (Contributed by Mario Carneiro, 29-May-2015.)
⊢ (𝜑 → 𝐴 ∈ On)    &   ⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅1‘𝐴))–1-1→On)    &   ⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))    &   ⊢ (𝜑 → 𝐶 ∈ On)    &   ⊢ 𝐻 = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶))    ⇒   ⊢ (𝜑 → (𝐺‘𝐶) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))
Theorem	dfac12lem2 10195*	Lemma for dfac12 10200. (Contributed by Mario Carneiro, 29-May-2015.)
⊢ (𝜑 → 𝐴 ∈ On)    &   ⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅1‘𝐴))–1-1→On)    &   ⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))    &   ⊢ (𝜑 → 𝐶 ∈ On)    &   ⊢ 𝐻 = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶))    &   ⊢ (𝜑 → 𝐶 ⊆ 𝐴)    &   ⊢ (𝜑 → ∀𝑧 ∈ 𝐶 (𝐺‘𝑧):(𝑅1‘𝑧)–1-1→On)    ⇒   ⊢ (𝜑 → (𝐺‘𝐶):(𝑅1‘𝐶)–1-1→On)
Theorem	dfac12lem3 10196*	Lemma for dfac12 10200. (Contributed by Mario Carneiro, 29-May-2015.)
⊢ (𝜑 → 𝐴 ∈ On)    &   ⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅1‘𝐴))–1-1→On)    &   ⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))    ⇒   ⊢ (𝜑 → (𝑅1‘𝐴) ∈ dom card)
Theorem	dfac12r 10197	The axiom of choice holds iff every ordinal has a well-orderable powerset. This version of dfac12 10200 does not assume the Axiom of Regularity. (Contributed by Mario Carneiro, 29-May-2015.)
⊢ (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∪ (𝑅1 “ On) ⊆ dom card)
Theorem	dfac12k 10198*	Equivalence of dfac12 10200 and dfac12a 10199, without using Regularity. (Contributed by Mario Carneiro, 21-May-2015.)
⊢ (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
Theorem	dfac12a 10199	The axiom of choice holds iff every ordinal has a well-orderable powerset. (Contributed by Mario Carneiro, 29-May-2015.)
⊢ (CHOICE ↔ ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card)
Theorem	dfac12 10200	The axiom of choice holds iff every aleph has a well-orderable powerset. (Contributed by Mario Carneiro, 21-May-2015.)
⊢ (CHOICE ↔ ∀𝑥 ∈ On 𝒫 (ℵ‘𝑥) ∈ dom card)