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

Theorem grothpw 10225
Description: Derive the Axiom of Power Sets ax-pow 5239 from the Tarski-Grothendieck axiom ax-groth 10222. That it follows is mentioned by Bob Solovay at http://www.cs.nyu.edu/pipermail/fom/2008-March/012783.html 10222. Note that ax-pow 5239 is not used by the proof. (Contributed by Gérard Lang, 22-Jun-2009.) (New usage is discouraged.)
Assertion
Ref Expression
grothpw 𝑦𝑧(∀𝑤(𝑤𝑧𝑤𝑥) → 𝑧𝑦)
Distinct variable group:   𝑥,𝑦,𝑧,𝑤

Proof of Theorem grothpw
StepHypRef Expression
1 simpl 486 . . . . . . . 8 ((𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) → 𝒫 𝑧𝑦)
21ralimi 3148 . . . . . . 7 (∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) → ∀𝑧𝑦 𝒫 𝑧𝑦)
3 pweq 4528 . . . . . . . . 9 (𝑧 = 𝑥 → 𝒫 𝑧 = 𝒫 𝑥)
43sseq1d 3974 . . . . . . . 8 (𝑧 = 𝑥 → (𝒫 𝑧𝑦 ↔ 𝒫 𝑥𝑦))
54rspccv 3597 . . . . . . 7 (∀𝑧𝑦 𝒫 𝑧𝑦 → (𝑥𝑦 → 𝒫 𝑥𝑦))
62, 5syl 17 . . . . . 6 (∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) → (𝑥𝑦 → 𝒫 𝑥𝑦))
76anim2i 619 . . . . 5 ((𝑥𝑦 ∧ ∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤)) → (𝑥𝑦 ∧ (𝑥𝑦 → 𝒫 𝑥𝑦)))
873adant3 1129 . . . 4 ((𝑥𝑦 ∧ ∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧𝑦𝑧𝑦)) → (𝑥𝑦 ∧ (𝑥𝑦 → 𝒫 𝑥𝑦)))
9 pm3.35 802 . . . 4 ((𝑥𝑦 ∧ (𝑥𝑦 → 𝒫 𝑥𝑦)) → 𝒫 𝑥𝑦)
10 vex 3474 . . . . 5 𝑦 ∈ V
1110ssex 5198 . . . 4 (𝒫 𝑥𝑦 → 𝒫 𝑥 ∈ V)
128, 9, 113syl 18 . . 3 ((𝑥𝑦 ∧ ∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧𝑦𝑧𝑦)) → 𝒫 𝑥 ∈ V)
13 axgroth5 10223 . . 3 𝑦(𝑥𝑦 ∧ ∀𝑧𝑦 (𝒫 𝑧𝑦 ∧ ∃𝑤𝑦 𝒫 𝑧𝑤) ∧ ∀𝑧 ∈ 𝒫 𝑦(𝑧𝑦𝑧𝑦))
1412, 13exlimiiv 1933 . 2 𝒫 𝑥 ∈ V
15 axpweq 5238 . 2 (𝒫 𝑥 ∈ V ↔ ∃𝑦𝑧(∀𝑤(𝑤𝑧𝑤𝑥) → 𝑧𝑦))
1614, 15mpbi 233 1 𝑦𝑧(∀𝑤(𝑤𝑧𝑤𝑥) → 𝑧𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 844  w3a 1084  wal 1536  wex 1781  wcel 2115  wral 3126  wrex 3127  Vcvv 3471  wss 3910  𝒫 cpw 4512   class class class wbr 5039  cen 8481
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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-groth 10222
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-in 3917  df-ss 3927  df-pw 4514
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator