Theorem ttac 43783

Description: Tarski's theorem about choice: infxpidm 10541 is equivalent to ax-ac 10438. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Proof shortened by Stefan O'Rear, 10-Jul-2015.)

Assertion

Ref	Expression
ttac	⊢ (CHOICE ↔ ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))

Proof of Theorem ttac

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfac10 10117	. 2 ⊢ (CHOICE ↔ dom card = V)
2		vex 3459	. . . . . 6 ⊢ 𝑐 ∈ V
3		eleq2 2852	. . . . . 6 ⊢ (dom card = V → (𝑐 ∈ dom card ↔ 𝑐 ∈ V))
4	2, 3	mpbiri 261	. . . . 5 ⊢ (dom card = V → 𝑐 ∈ dom card)
5		infxpidm2 9997	. . . . . 6 ⊢ ((𝑐 ∈ dom card ∧ ω ≼ 𝑐) → (𝑐 × 𝑐) ≈ 𝑐)
6	5	ex 417	. . . . 5 ⊢ (𝑐 ∈ dom card → (ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
7	4, 6	syl 18	. . . 4 ⊢ (dom card = V → (ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
8	7	alrimiv 1957	. . 3 ⊢ (dom card = V → ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
9		finnum 9930	. . . . . . 7 ⊢ (𝑎 ∈ Fin → 𝑎 ∈ dom card)
10	9	adantl 486	. . . . . 6 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ 𝑎 ∈ Fin) → 𝑎 ∈ dom card)
11		harcl 9517	. . . . . . . . 9 ⊢ (har‘𝑎) ∈ On
12		onenon 9931	. . . . . . . . 9 ⊢ ((har‘𝑎) ∈ On → (har‘𝑎) ∈ dom card)
13	11, 12	ax-mp 5	. . . . . . . 8 ⊢ (har‘𝑎) ∈ dom card
14		fvex 6894	. . . . . . . . . . . . . 14 ⊢ (har‘𝑎) ∈ V
15		vex 3459	. . . . . . . . . . . . . 14 ⊢ 𝑎 ∈ V
16	14, 15	unex 7742	. . . . . . . . . . . . 13 ⊢ ((har‘𝑎) ∪ 𝑎) ∈ V
17		harinf 43781	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ V ∧ ¬ 𝑎 ∈ Fin) → ω ⊆ (har‘𝑎))
18	15, 17	mpan 702	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑎 ∈ Fin → ω ⊆ (har‘𝑎))
19		ssun1 4131	. . . . . . . . . . . . . 14 ⊢ (har‘𝑎) ⊆ ((har‘𝑎) ∪ 𝑎)
20	18, 19	sstrdi 3949	. . . . . . . . . . . . 13 ⊢ (¬ 𝑎 ∈ Fin → ω ⊆ ((har‘𝑎) ∪ 𝑎))
21		ssdomg 8993	. . . . . . . . . . . . 13 ⊢ (((har‘𝑎) ∪ 𝑎) ∈ V → (ω ⊆ ((har‘𝑎) ∪ 𝑎) → ω ≼ ((har‘𝑎) ∪ 𝑎)))
22	16, 20, 21	mpsyl 69	. . . . . . . . . . . 12 ⊢ (¬ 𝑎 ∈ Fin → ω ≼ ((har‘𝑎) ∪ 𝑎))
23		breq2 5113	. . . . . . . . . . . . . 14 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → (ω ≼ 𝑐 ↔ ω ≼ ((har‘𝑎) ∪ 𝑎)))
24		xpeq12 5686	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 = ((har‘𝑎) ∪ 𝑎) ∧ 𝑐 = ((har‘𝑎) ∪ 𝑎)) → (𝑐 × 𝑐) = (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)))
25	24	anidms 576	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → (𝑐 × 𝑐) = (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)))
26		id 23	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → 𝑐 = ((har‘𝑎) ∪ 𝑎))
27	25, 26	breq12d 5122	. . . . . . . . . . . . . 14 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → ((𝑐 × 𝑐) ≈ 𝑐 ↔ (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
28	23, 27	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → ((ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ↔ (ω ≼ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎))))
29	16, 28	spcv 3564	. . . . . . . . . . . 12 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → (ω ≼ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
30	22, 29	syl5 35	. . . . . . . . . . 11 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → (¬ 𝑎 ∈ Fin → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
31	30	imp 411	. . . . . . . . . 10 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎))
32		harndom 9520	. . . . . . . . . . . 12 ⊢ ¬ (har‘𝑎) ≼ 𝑎
33		ssdomg 8993	. . . . . . . . . . . . . 14 ⊢ (((har‘𝑎) ∪ 𝑎) ∈ V → ((har‘𝑎) ⊆ ((har‘𝑎) ∪ 𝑎) → (har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎)))
34	16, 19, 33	mp2 9	. . . . . . . . . . . . 13 ⊢ (har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎)
35		domtr 9000	. . . . . . . . . . . . 13 ⊢ (((har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎) ∧ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎) → (har‘𝑎) ≼ 𝑎)
36	34, 35	mpan 702	. . . . . . . . . . . 12 ⊢ (((har‘𝑎) ∪ 𝑎) ≼ 𝑎 → (har‘𝑎) ≼ 𝑎)
37	32, 36	mto 200	. . . . . . . . . . 11 ⊢ ¬ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎
38		unxpwdom2 9546	. . . . . . . . . . 11 ⊢ ((((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎) ∨ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎))
39		orel2 903	. . . . . . . . . . 11 ⊢ (¬ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎 → ((((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎) ∨ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎) → ((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎)))
40	37, 38, 39	mpsyl 69	. . . . . . . . . 10 ⊢ ((((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎) → ((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎))
41	31, 40	syl 18	. . . . . . . . 9 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎))
42		wdomnumr 10044	. . . . . . . . . 10 ⊢ ((har‘𝑎) ∈ dom card → (((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎) ↔ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎)))
43	13, 42	ax-mp 5	. . . . . . . . 9 ⊢ (((har‘𝑎) ∪ 𝑎) ≼* (har‘𝑎) ↔ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎))
44	41, 43	sylib 221	. . . . . . . 8 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎))
45		numdom 10018	. . . . . . . 8 ⊢ (((har‘𝑎) ∈ dom card ∧ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎)) → ((har‘𝑎) ∪ 𝑎) ∈ dom card)
46	13, 44, 45	sylancr 598	. . . . . . 7 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ∈ dom card)
47		ssun2 4132	. . . . . . 7 ⊢ 𝑎 ⊆ ((har‘𝑎) ∪ 𝑎)
48		ssnum 10019	. . . . . . 7 ⊢ ((((har‘𝑎) ∪ 𝑎) ∈ dom card ∧ 𝑎 ⊆ ((har‘𝑎) ∪ 𝑎)) → 𝑎 ∈ dom card)
49	46, 47, 48	sylancl 597	. . . . . 6 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → 𝑎 ∈ dom card)
50	10, 49	pm2.61dan 824	. . . . 5 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → 𝑎 ∈ dom card)
51	50	alrimiv 1957	. . . 4 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → ∀𝑎 𝑎 ∈ dom card)
52		eqv 3465	. . . 4 ⊢ (dom card = V ↔ ∀𝑎 𝑎 ∈ dom card)
53	51, 52	sylibr 237	. . 3 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → dom card = V)
54	8, 53	impbii 212	. 2 ⊢ (dom card = V ↔ ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
55	1, 54	bitri 278	1 ⊢ (CHOICE ↔ ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860  ∀wal 1568   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∪ cun 3903   ⊆ wss 3905   class class class wbr 5109   × cxp 5659  dom cdm 5661  Oncon0 6360  ‘cfv 6536  ωcom 7858   ≈ cen 8936   ≼ cdom 8937  Fincfn 8939  harchar 9514   ≼^* cwdom 9522  cardccrd 9917  CHOICEwac 10095

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-oi 9468  df-har 9515  df-wdom 9523  df-card 9921  df-acn 9924  df-ac 10096

This theorem is referenced by: (None)