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

Theorem ralnex3OLD 3263
Description: Obsolete version of ralnex3 3262 as of 18-May-2023. (Contributed by Thierry Arnoux, 12-Jul-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ralnex3OLD (∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑 ↔ ¬ ∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑)

Proof of Theorem ralnex3OLD
StepHypRef Expression
1 notnotb 317 . 2 (∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑 ↔ ¬ ¬ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑)
2 notnotb 317 . . . . 5 (𝜑 ↔ ¬ ¬ 𝜑)
32rexbii 3247 . . . 4 (∃𝑧𝐶 𝜑 ↔ ∃𝑧𝐶 ¬ ¬ 𝜑)
432rexbii 3248 . . 3 (∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∃𝑥𝐴𝑦𝐵𝑧𝐶 ¬ ¬ 𝜑)
5 rexnal3 3259 . . 3 (∃𝑥𝐴𝑦𝐵𝑧𝐶 ¬ ¬ 𝜑 ↔ ¬ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑)
64, 5bitr2i 278 . 2 (¬ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑 ↔ ∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑)
71, 6xchbinx 336 1 (∀𝑥𝐴𝑦𝐵𝑧𝐶 ¬ 𝜑 ↔ ¬ ∃𝑥𝐴𝑦𝐵𝑧𝐶 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wral 3138  wrex 3139
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-ral 3143  df-rex 3144
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator