Theorem grothac 10753

Description: The Tarski-Grothendieck Axiom implies the Axiom of Choice (in the form of cardeqv 10391). This can be put in a more conventional form via ween 9957 and dfac8 10058. Note that the mere existence of strongly inaccessible cardinals doesn't imply AC, but rather the particular form of the Tarski-Grothendieck axiom (see https://fomarchive.ugent.be/2008-March/012783.html 10058). (Contributed by Mario Carneiro, 19-Apr-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
grothac	⊢ dom card = V

Proof of Theorem grothac

Dummy variables 𝑥 𝑦 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pweq 4555	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 𝑦)
2	1	sseq1d 3953	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝒫 𝑥 ⊆ 𝑢 ↔ 𝒫 𝑦 ⊆ 𝑢))
3	1	eleq1d 2821	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝒫 𝑥 ∈ 𝑢 ↔ 𝒫 𝑦 ∈ 𝑢))
4	2, 3	anbi12d 633	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢) ↔ (𝒫 𝑦 ⊆ 𝑢 ∧ 𝒫 𝑦 ∈ 𝑢)))
5	4	rspcva 3562	. . . . . . 7 ⊢ ((𝑦 ∈ 𝑢 ∧ ∀𝑥 ∈ 𝑢 (𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢)) → (𝒫 𝑦 ⊆ 𝑢 ∧ 𝒫 𝑦 ∈ 𝑢))
6	5	simpld 494	. . . . . 6 ⊢ ((𝑦 ∈ 𝑢 ∧ ∀𝑥 ∈ 𝑢 (𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢)) → 𝒫 𝑦 ⊆ 𝑢)
7		rabss 4010	. . . . . . 7 ⊢ ({𝑥 ∈ 𝒫 𝑢 ∣ 𝑥 ≺ 𝑢} ⊆ 𝑢 ↔ ∀𝑥 ∈ 𝒫 𝑢(𝑥 ≺ 𝑢 → 𝑥 ∈ 𝑢))
8	7	biimpri 228	. . . . . 6 ⊢ (∀𝑥 ∈ 𝒫 𝑢(𝑥 ≺ 𝑢 → 𝑥 ∈ 𝑢) → {𝑥 ∈ 𝒫 𝑢 ∣ 𝑥 ≺ 𝑢} ⊆ 𝑢)
9		vex 3433	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
10	9	canth2 9068	. . . . . . . . 9 ⊢ 𝑦 ≺ 𝒫 𝑦
11		sdomdom 8927	. . . . . . . . 9 ⊢ (𝑦 ≺ 𝒫 𝑦 → 𝑦 ≼ 𝒫 𝑦)
12	10, 11	ax-mp 5	. . . . . . . 8 ⊢ 𝑦 ≼ 𝒫 𝑦
13		ssdomg 8947	. . . . . . . . 9 ⊢ (𝑢 ∈ V → (𝒫 𝑦 ⊆ 𝑢 → 𝒫 𝑦 ≼ 𝑢))
14	13	elv 3434	. . . . . . . 8 ⊢ (𝒫 𝑦 ⊆ 𝑢 → 𝒫 𝑦 ≼ 𝑢)
15		domtr 8954	. . . . . . . 8 ⊢ ((𝑦 ≼ 𝒫 𝑦 ∧ 𝒫 𝑦 ≼ 𝑢) → 𝑦 ≼ 𝑢)
16	12, 14, 15	sylancr 588	. . . . . . 7 ⊢ (𝒫 𝑦 ⊆ 𝑢 → 𝑦 ≼ 𝑢)
17		vex 3433	. . . . . . . 8 ⊢ 𝑢 ∈ V
18		tskwe 9874	. . . . . . . 8 ⊢ ((𝑢 ∈ V ∧ {𝑥 ∈ 𝒫 𝑢 ∣ 𝑥 ≺ 𝑢} ⊆ 𝑢) → 𝑢 ∈ dom card)
19	17, 18	mpan 691	. . . . . . 7 ⊢ ({𝑥 ∈ 𝒫 𝑢 ∣ 𝑥 ≺ 𝑢} ⊆ 𝑢 → 𝑢 ∈ dom card)
20		numdom 9960	. . . . . . . 8 ⊢ ((𝑢 ∈ dom card ∧ 𝑦 ≼ 𝑢) → 𝑦 ∈ dom card)
21	20	expcom 413	. . . . . . 7 ⊢ (𝑦 ≼ 𝑢 → (𝑢 ∈ dom card → 𝑦 ∈ dom card))
22	16, 19, 21	syl2im 40	. . . . . 6 ⊢ (𝒫 𝑦 ⊆ 𝑢 → ({𝑥 ∈ 𝒫 𝑢 ∣ 𝑥 ≺ 𝑢} ⊆ 𝑢 → 𝑦 ∈ dom card))
23	6, 8, 22	syl2im 40	. . . . 5 ⊢ ((𝑦 ∈ 𝑢 ∧ ∀𝑥 ∈ 𝑢 (𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢)) → (∀𝑥 ∈ 𝒫 𝑢(𝑥 ≺ 𝑢 → 𝑥 ∈ 𝑢) → 𝑦 ∈ dom card))
24	23	3impia 1118	. . . 4 ⊢ ((𝑦 ∈ 𝑢 ∧ ∀𝑥 ∈ 𝑢 (𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢) ∧ ∀𝑥 ∈ 𝒫 𝑢(𝑥 ≺ 𝑢 → 𝑥 ∈ 𝑢)) → 𝑦 ∈ dom card)
25		axgroth6 10751	. . . 4 ⊢ ∃𝑢(𝑦 ∈ 𝑢 ∧ ∀𝑥 ∈ 𝑢 (𝒫 𝑥 ⊆ 𝑢 ∧ 𝒫 𝑥 ∈ 𝑢) ∧ ∀𝑥 ∈ 𝒫 𝑢(𝑥 ≺ 𝑢 → 𝑥 ∈ 𝑢))
26	24, 25	exlimiiv 1933	. . 3 ⊢ 𝑦 ∈ dom card
27	26, 9	2th 264	. 2 ⊢ (𝑦 ∈ dom card ↔ 𝑦 ∈ V)
28	27	eqriv 2733	1 ⊢ dom card = V

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3051  {crab 3389  Vcvv 3429   ⊆ wss 3889  𝒫 cpw 4541   class class class wbr 5085  dom cdm 5631   ≼ cdom 8891   ≺ csdm 8892  cardccrd 9859

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-groth 10746

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-card 9863

This theorem is referenced by:  axgroth3  10754