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

Theorem grothtsk 10735
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 10724 . . . . 5 𝑥(𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))
2 eltskg 10650 . . . . . . . . 9 (𝑥 ∈ V → (𝑥 ∈ Tarski ↔ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
32elv 3442 . . . . . . . 8 (𝑥 ∈ Tarski ↔ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
43anbi2i 623 . . . . . . 7 ((𝑤𝑥𝑥 ∈ Tarski) ↔ (𝑤𝑥 ∧ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
5 3anass 1094 . . . . . . 7 ((𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)) ↔ (𝑤𝑥 ∧ (∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥))))
64, 5bitr4i 278 . . . . . 6 ((𝑤𝑥𝑥 ∈ Tarski) ↔ (𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
76exbii 1849 . . . . 5 (∃𝑥(𝑤𝑥𝑥 ∈ Tarski) ↔ ∃𝑥(𝑤𝑥 ∧ ∀𝑦𝑥 (𝒫 𝑦𝑥 ∧ ∃𝑧𝑥 𝒫 𝑦𝑧) ∧ ∀𝑦 ∈ 𝒫 𝑥(𝑦𝑥𝑦𝑥)))
81, 7mpbir 231 . . . 4 𝑥(𝑤𝑥𝑥 ∈ Tarski)
9 eluni 4863 . . . 4 (𝑤 Tarski ↔ ∃𝑥(𝑤𝑥𝑥 ∈ Tarski))
108, 9mpbir 231 . . 3 𝑤 Tarski
11 vex 3441 . . 3 𝑤 ∈ V
1210, 112th 264 . 2 (𝑤 Tarski ↔ 𝑤 ∈ V)
1312eqriv 2730 1 Tarski = V
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wo 847  w3a 1086   = wceq 1541  wex 1780  wcel 2113  wral 3048  wrex 3057  Vcvv 3437  wss 3898  𝒫 cpw 4551   cuni 4860   class class class wbr 5095  cen 8874  Tarskictsk 10648
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-groth 10723
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-tsk 10649
This theorem is referenced by:  inaprc  10736  tskmval  10739  tskmcl  10741
  Copyright terms: Public domain W3C validator