Theorem aceq2 10122

Description: 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.)

Assertion

Ref	Expression
aceq2	⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢

Proof of Theorem aceq2

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ral 3077	. . . . 5 ⊢ (∀𝑡 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∀𝑡(𝑡 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
2		19.23v 1975	. . . . 5 ⊢ (∀𝑡(𝑡 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ↔ (∃𝑡 𝑡 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
3	1, 2	bitri 278	. . . 4 ⊢ (∀𝑡 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ (∃𝑡 𝑡 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
4		biidd 265	. . . . 5 ⊢ (𝑤 = 𝑡 → (∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
5	4	cbvralvw 3240	. . . 4 ⊢ (∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∀𝑡 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
6		n0 4300	. . . . 5 ⊢ (𝑧 ≠ ∅ ↔ ∃𝑡 𝑡 ∈ 𝑧)
7		elequ2 2160	. . . . . . . . 9 ⊢ (𝑣 = 𝑢 → (𝑧 ∈ 𝑣 ↔ 𝑧 ∈ 𝑢))
8		elequ2 2160	. . . . . . . . 9 ⊢ (𝑣 = 𝑢 → (𝑤 ∈ 𝑣 ↔ 𝑤 ∈ 𝑢))
9	7, 8	anbi12d 644	. . . . . . . 8 ⊢ (𝑣 = 𝑢 → ((𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ↔ (𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢)))
10	9	cbvrexvw 3241	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ↔ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢))
11	10	reubii 3374	. . . . . 6 ⊢ (∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ↔ ∃!𝑤 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢))
12		elequ1 2152	. . . . . . . . 9 ⊢ (𝑤 = 𝑣 → (𝑤 ∈ 𝑢 ↔ 𝑣 ∈ 𝑢))
13	12	anbi2d 642	. . . . . . . 8 ⊢ (𝑤 = 𝑣 → ((𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢) ↔ (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
14	13	rexbidv 3186	. . . . . . 7 ⊢ (𝑤 = 𝑣 → (∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
15	14	cbvreuvw 3387	. . . . . 6 ⊢ (∃!𝑤 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑤 ∈ 𝑢) ↔ ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
16	11, 15	bitri 278	. . . . 5 ⊢ (∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣) ↔ ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
17	6, 16	imbi12i 353	. . . 4 ⊢ ((𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)) ↔ (∃𝑡 𝑡 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
18	3, 5, 17	3bitr4i 306	. . 3 ⊢ (∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))
19	18	ralbii 3108	. 2 ⊢ (∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))
20	19	exbii 1881	1 ⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → ∃!𝑤 ∈ 𝑧 ∃𝑣 ∈ 𝑦 (𝑧 ∈ 𝑣 ∧ 𝑤 ∈ 𝑣)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  ∃!wreu 3363  ∅c0 4279

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-dif 3902  df-nul 4280

This theorem is used by:  dfac7  10135  ac3  10464