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

Theorem grothtsk 10257
Description: The Tarski-Grothendieck Axiom, using abbreviations. (Contributed by Mario Carneiro, 28-May-2013.)
Assertion
Ref Expression
grothtsk Tarski = V

Proof of Theorem grothtsk
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 axgroth5 10246 . . . . 5 𝑥(𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))
2 eltskg 10172 . . . . . . . . 9 (𝑥 ∈ V → (𝑥 ∈ Tarski ↔ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
32elv 3499 . . . . . . . 8 (𝑥 ∈ Tarski ↔ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
43anbi2i 624 . . . . . . 7 ((𝑤𝑥𝑥 ∈ Tarski) ↔ (𝑤𝑥 ∧ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
5 3anass 1091 . . . . . . 7 ((𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)) ↔ (𝑤𝑥 ∧ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
64, 5bitr4i 280 . . . . . 6 ((𝑤𝑥𝑥 ∈ Tarski) ↔ (𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
76exbii 1848 . . . . 5 (∃𝑥(𝑤𝑥𝑥 ∈ Tarski) ↔ ∃𝑥(𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
81, 7mpbir 233 . . . 4 𝑥(𝑤𝑥𝑥 ∈ Tarski)
9 eluni 4841 . . . 4 (𝑤 Tarski ↔ ∃𝑥(𝑤𝑥𝑥 ∈ Tarski))
108, 9mpbir 233 . . 3 𝑤 Tarski
11 vex 3497 . . 3 𝑤 ∈ V
1210, 112th 266 . 2 (𝑤 Tarski ↔ 𝑤 ∈ V)
1312eqriv 2818 1 Tarski = V
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wo 843  w3a 1083   = wceq 1537  wex 1780  wcel 2114  wral 3138  wrex 3139  Vcvv 3494  wss 3936  𝒫 cpw 4539   cuni 4838   class class class wbr 5066  cen 8506  Tarskictsk 10170
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-groth 10245
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-tsk 10171
This theorem is referenced by:  inaprc  10258  tskmval  10261  tskmcl  10263
  Copyright terms: Public domain W3C validator