MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grothac Structured version   Visualization version   GIF version

Theorem grothac 10744
Description: The Tarski-Grothendieck Axiom implies the Axiom of Choice (in the form of cardeqv 10382). This can be put in a more conventional form via ween 9948 and dfac8 10049. 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 10049). (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.
StepHypRef Expression
1 pweq 4543 . . . . . . . . . 10 (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 𝑦)
21sseq1d 3946 . . . . . . . . 9 (𝑥 = 𝑦 → (𝒫 𝑥𝑢 ↔ 𝒫 𝑦𝑢))
31eleq1d 2824 . . . . . . . . 9 (𝑥 = 𝑦 → (𝒫 𝑥𝑢 ↔ 𝒫 𝑦𝑢))
42, 3anbi12d 638 . . . . . . . 8 (𝑥 = 𝑦 → ((𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢) ↔ (𝒫 𝑦𝑢 ∧ 𝒫 𝑦𝑢)))
54rspcva 3558 . . . . . . 7 ((𝑦𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢)) → (𝒫 𝑦𝑢 ∧ 𝒫 𝑦𝑢))
65simpld 495 . . . . . 6 ((𝑦𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢)) → 𝒫 𝑦𝑢)
7 rabss 4001 . . . . . . 7 ({𝑥 ∈ 𝒫 𝑢𝑥𝑢} ⊆ 𝑢 ↔ ∀𝑥 ∈ 𝒫 𝑢(𝑥𝑢𝑥𝑢))
87biimpri 229 . . . . . 6 (∀𝑥 ∈ 𝒫 𝑢(𝑥𝑢𝑥𝑢) → {𝑥 ∈ 𝒫 𝑢𝑥𝑢} ⊆ 𝑢)
9 vex 3435 . . . . . . . . . 10 𝑦 ∈ V
109canth2 9058 . . . . . . . . 9 𝑦 ≺ 𝒫 𝑦
11 sdomdom 8917 . . . . . . . . 9 (𝑦 ≺ 𝒫 𝑦𝑦 ≼ 𝒫 𝑦)
1210, 11ax-mp 5 . . . . . . . 8 𝑦 ≼ 𝒫 𝑦
13 ssdomg 8937 . . . . . . . . 9 (𝑢 ∈ V → (𝒫 𝑦𝑢 → 𝒫 𝑦𝑢))
1413elv 3436 . . . . . . . 8 (𝒫 𝑦𝑢 → 𝒫 𝑦𝑢)
15 domtr 8944 . . . . . . . 8 ((𝑦 ≼ 𝒫 𝑦 ∧ 𝒫 𝑦𝑢) → 𝑦𝑢)
1612, 14, 15sylancr 593 . . . . . . 7 (𝒫 𝑦𝑢𝑦𝑢)
17 vex 3435 . . . . . . . 8 𝑢 ∈ V
18 tskwe 9865 . . . . . . . 8 ((𝑢 ∈ V ∧ {𝑥 ∈ 𝒫 𝑢𝑥𝑢} ⊆ 𝑢) → 𝑢 ∈ dom card)
1917, 18mpan 696 . . . . . . 7 ({𝑥 ∈ 𝒫 𝑢𝑥𝑢} ⊆ 𝑢𝑢 ∈ dom card)
20 numdom 9951 . . . . . . . 8 ((𝑢 ∈ dom card ∧ 𝑦𝑢) → 𝑦 ∈ dom card)
2120expcom 414 . . . . . . 7 (𝑦𝑢 → (𝑢 ∈ dom card → 𝑦 ∈ dom card))
2216, 19, 21syl2im 40 . . . . . 6 (𝒫 𝑦𝑢 → ({𝑥 ∈ 𝒫 𝑢𝑥𝑢} ⊆ 𝑢𝑦 ∈ dom card))
236, 8, 22syl2im 40 . . . . 5 ((𝑦𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢)) → (∀𝑥 ∈ 𝒫 𝑢(𝑥𝑢𝑥𝑢) → 𝑦 ∈ dom card))
24233impia 1123 . . . 4 ((𝑦𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢) ∧ ∀𝑥 ∈ 𝒫 𝑢(𝑥𝑢𝑥𝑢)) → 𝑦 ∈ dom card)
25 axgroth6 10742 . . . 4 𝑢(𝑦𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ 𝒫 𝑥𝑢) ∧ ∀𝑥 ∈ 𝒫 𝑢(𝑥𝑢𝑥𝑢))
2624, 25exlimiiv 1938 . . 3 𝑦 ∈ dom card
2726, 92th 265 . 2 (𝑦 ∈ dom card ↔ 𝑦 ∈ V)
2827eqriv 2736 1 dom card = V
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3053  {crab 3391  Vcvv 3431  wss 3883  𝒫 cpw 4529   class class class wbr 5072  dom cdm 5618  cdom 8881  csdm 8882  cardccrd 9850
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-groth 10737
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-isom 6494  df-riota 7313  df-ov 7359  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-card 9854
This theorem is referenced by:  axgroth3  10745
  Copyright terms: Public domain W3C validator