Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  axrepprim Structured version   Visualization version   GIF version

Theorem axrepprim 35918
Description: ax-rep 5226 without distinct variable conditions or defined symbols. (Contributed by Scott Fenton, 13-Oct-2010.)
Assertion
Ref Expression
axrepprim ¬ ∀𝑥 ¬ (¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥)))

Proof of Theorem axrepprim
StepHypRef Expression
1 axrepnd 10517 . 2 𝑥(∃𝑦𝑧(𝜑𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑)))
2 df-ex 1782 . . . . 5 (∃𝑦𝑧(𝜑𝑧 = 𝑦) ↔ ¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦))
3 df-an 396 . . . . . . . . . 10 ((∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑) ↔ ¬ (∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑))
43exbii 1850 . . . . . . . . 9 (∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑) ↔ ∃𝑥 ¬ (∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑))
5 exnal 1829 . . . . . . . . 9 (∃𝑥 ¬ (∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) ↔ ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑))
64, 5bitri 275 . . . . . . . 8 (∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑) ↔ ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑))
76bibi2i 337 . . . . . . 7 ((∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑)) ↔ (∀𝑦 𝑧𝑥 ↔ ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)))
8 dfbi1 213 . . . . . . 7 ((∀𝑦 𝑧𝑥 ↔ ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) ↔ ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥)))
97, 8bitri 275 . . . . . 6 ((∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑)) ↔ ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥)))
109albii 1821 . . . . 5 (∀𝑧(∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑)) ↔ ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥)))
112, 10imbi12i 350 . . . 4 ((∃𝑦𝑧(𝜑𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑))) ↔ (¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥))))
1211exbii 1850 . . 3 (∃𝑥(∃𝑦𝑧(𝜑𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑))) ↔ ∃𝑥(¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥))))
13 df-ex 1782 . . 3 (∃𝑥(¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥))) ↔ ¬ ∀𝑥 ¬ (¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥))))
1412, 13bitri 275 . 2 (∃𝑥(∃𝑦𝑧(𝜑𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧𝑥 ↔ ∃𝑥(∀𝑧 𝑥𝑦 ∧ ∀𝑦𝜑))) ↔ ¬ ∀𝑥 ¬ (¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥))))
151, 14mpbi 230 1 ¬ ∀𝑥 ¬ (¬ ∀𝑦 ¬ ∀𝑧(𝜑𝑧 = 𝑦) → ∀𝑧 ¬ ((∀𝑦 𝑧𝑥 → ¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑)) → ¬ (¬ ∀𝑥(∀𝑧 𝑥𝑦 → ¬ ∀𝑦𝜑) → ∀𝑦 𝑧𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1540  wex 1781
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-13 2377  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-pr 5379  ax-reg 9509
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-nf 1786  df-sb 2069  df-cleq 2729  df-clel 2812  df-nfc 2886
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator