ttac - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ttac		Structured version Visualization version GIF version

Theorem ttac 41760

Description: Tarski's theorem about choice: infxpidm 10553 is equivalent to ax-ac 10450. (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 10128	. 2 ⊢ (CHOICE ↔ dom card = V)
2		vex 3478	. . . . . 6 ⊢ 𝑐 ∈ V
3		eleq2 2822	. . . . . 6 ⊢ (dom card = V → (𝑐 ∈ dom card ↔ 𝑐 ∈ V))
4	2, 3	mpbiri 257	. . . . 5 ⊢ (dom card = V → 𝑐 ∈ dom card)
5		infxpidm2 10008	. . . . . 6 ⊢ ((𝑐 ∈ dom card ∧ ω ≼ 𝑐) → (𝑐 × 𝑐) ≈ 𝑐)
6	5	ex 413	. . . . 5 ⊢ (𝑐 ∈ dom card → (ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
7	4, 6	syl 17	. . . 4 ⊢ (dom card = V → (ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
8	7	alrimiv 1930	. . 3 ⊢ (dom card = V → ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
9		finnum 9939	. . . . . . 7 ⊢ (𝑎 ∈ Fin → 𝑎 ∈ dom card)
10	9	adantl 482	. . . . . 6 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ 𝑎 ∈ Fin) → 𝑎 ∈ dom card)
11		harcl 9550	. . . . . . . . 9 ⊢ (har‘𝑎) ∈ On
12		onenon 9940	. . . . . . . . 9 ⊢ ((har‘𝑎) ∈ On → (har‘𝑎) ∈ dom card)
13	11, 12	ax-mp 5	. . . . . . . 8 ⊢ (har‘𝑎) ∈ dom card
14		fvex 6901	. . . . . . . . . . . . . 14 ⊢ (har‘𝑎) ∈ V
15		vex 3478	. . . . . . . . . . . . . 14 ⊢ 𝑎 ∈ V
16	14, 15	unex 7729	. . . . . . . . . . . . 13 ⊢ ((har‘𝑎) ∪ 𝑎) ∈ V
17		harinf 41758	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ V ∧ ¬ 𝑎 ∈ Fin) → ω ⊆ (har‘𝑎))
18	15, 17	mpan 688	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑎 ∈ Fin → ω ⊆ (har‘𝑎))
19		ssun1 4171	. . . . . . . . . . . . . 14 ⊢ (har‘𝑎) ⊆ ((har‘𝑎) ∪ 𝑎)
20	18, 19	sstrdi 3993	. . . . . . . . . . . . 13 ⊢ (¬ 𝑎 ∈ Fin → ω ⊆ ((har‘𝑎) ∪ 𝑎))
21		ssdomg 8992	. . . . . . . . . . . . 13 ⊢ (((har‘𝑎) ∪ 𝑎) ∈ V → (ω ⊆ ((har‘𝑎) ∪ 𝑎) → ω ≼ ((har‘𝑎) ∪ 𝑎)))
22	16, 20, 21	mpsyl 68	. . . . . . . . . . . 12 ⊢ (¬ 𝑎 ∈ Fin → ω ≼ ((har‘𝑎) ∪ 𝑎))
23		breq2 5151	. . . . . . . . . . . . . 14 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → (ω ≼ 𝑐 ↔ ω ≼ ((har‘𝑎) ∪ 𝑎)))
24		xpeq12 5700	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 = ((har‘𝑎) ∪ 𝑎) ∧ 𝑐 = ((har‘𝑎) ∪ 𝑎)) → (𝑐 × 𝑐) = (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)))
25	24	anidms 567	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → (𝑐 × 𝑐) = (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)))
26		id 22	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → 𝑐 = ((har‘𝑎) ∪ 𝑎))
27	25, 26	breq12d 5160	. . . . . . . . . . . . . 14 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → ((𝑐 × 𝑐) ≈ 𝑐 ↔ (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
28	23, 27	imbi12d 344	. . . . . . . . . . . . 13 ⊢ (𝑐 = ((har‘𝑎) ∪ 𝑎) → ((ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ↔ (ω ≼ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎))))
29	16, 28	spcv 3595	. . . . . . . . . . . 12 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → (ω ≼ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
30	22, 29	syl5 34	. . . . . . . . . . 11 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → (¬ 𝑎 ∈ Fin → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎)))
31	30	imp 407	. . . . . . . . . 10 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → (((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎))
32		harndom 9553	. . . . . . . . . . . 12 ⊢ ¬ (har‘𝑎) ≼ 𝑎
33		ssdomg 8992	. . . . . . . . . . . . . 14 ⊢ (((har‘𝑎) ∪ 𝑎) ∈ V → ((har‘𝑎) ⊆ ((har‘𝑎) ∪ 𝑎) → (har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎)))
34	16, 19, 33	mp2 9	. . . . . . . . . . . . 13 ⊢ (har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎)
35		domtr 8999	. . . . . . . . . . . . 13 ⊢ (((har‘𝑎) ≼ ((har‘𝑎) ∪ 𝑎) ∧ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎) → (har‘𝑎) ≼ 𝑎)
36	34, 35	mpan 688	. . . . . . . . . . . 12 ⊢ (((har‘𝑎) ∪ 𝑎) ≼ 𝑎 → (har‘𝑎) ≼ 𝑎)
37	32, 36	mto 196	. . . . . . . . . . 11 ⊢ ¬ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎
38		unxpwdom2 9579	. . . . . . . . . . 11 ⊢ ((((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎) → (((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎) ∨ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎))
39		orel2 889	. . . . . . . . . . 11 ⊢ (¬ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎 → ((((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎) ∨ ((har‘𝑎) ∪ 𝑎) ≼ 𝑎) → ((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎)))
40	37, 38, 39	mpsyl 68	. . . . . . . . . 10 ⊢ ((((har‘𝑎) ∪ 𝑎) × ((har‘𝑎) ∪ 𝑎)) ≈ ((har‘𝑎) ∪ 𝑎) → ((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎))
41	31, 40	syl 17	. . . . . . . . 9 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎))
42		wdomnumr 10055	. . . . . . . . . 10 ⊢ ((har‘𝑎) ∈ dom card → (((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎) ↔ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎)))
43	13, 42	ax-mp 5	. . . . . . . . 9 ⊢ (((har‘𝑎) ∪ 𝑎) ≼^* (har‘𝑎) ↔ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎))
44	41, 43	sylib 217	. . . . . . . 8 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎))
45		numdom 10029	. . . . . . . 8 ⊢ (((har‘𝑎) ∈ dom card ∧ ((har‘𝑎) ∪ 𝑎) ≼ (har‘𝑎)) → ((har‘𝑎) ∪ 𝑎) ∈ dom card)
46	13, 44, 45	sylancr 587	. . . . . . 7 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → ((har‘𝑎) ∪ 𝑎) ∈ dom card)
47		ssun2 4172	. . . . . . 7 ⊢ 𝑎 ⊆ ((har‘𝑎) ∪ 𝑎)
48		ssnum 10030	. . . . . . 7 ⊢ ((((har‘𝑎) ∪ 𝑎) ∈ dom card ∧ 𝑎 ⊆ ((har‘𝑎) ∪ 𝑎)) → 𝑎 ∈ dom card)
49	46, 47, 48	sylancl 586	. . . . . 6 ⊢ ((∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) ∧ ¬ 𝑎 ∈ Fin) → 𝑎 ∈ dom card)
50	10, 49	pm2.61dan 811	. . . . 5 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → 𝑎 ∈ dom card)
51	50	alrimiv 1930	. . . 4 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → ∀𝑎 𝑎 ∈ dom card)
52		eqv 3483	. . . 4 ⊢ (dom card = V ↔ ∀𝑎 𝑎 ∈ dom card)
53	51, 52	sylibr 233	. . 3 ⊢ (∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐) → dom card = V)
54	8, 53	impbii 208	. 2 ⊢ (dom card = V ↔ ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))
55	1, 54	bitri 274	1 ⊢ (CHOICE ↔ ∀𝑐(ω ≼ 𝑐 → (𝑐 × 𝑐) ≈ 𝑐))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 ∀wal 1539 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∪ cun 3945 ⊆ wss 3947 class class class wbr 5147 × cxp 5673 dom cdm 5675 Oncon0 6361 ‘cfv 6540 ωcom 7851 ≈ cen 8932 ≼ cdom 8933 Fincfn 8935 harchar 9547 ≼^* cwdom 9555 cardccrd 9926 CHOICEwac 10106

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-oi 9501 df-har 9548 df-wdom 9556 df-card 9930 df-acn 9933 df-ac 10107

This theorem is referenced by: (None)

W3C validator