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

Theorem 2ralor 3360
 Description: Distribute restricted universal quantification over "or". (Contributed by Jeff Madsen, 19-Jun-2010.)
Assertion
Ref Expression
2ralor (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑 ∨ ∀𝑦𝐵 𝜓))
Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem 2ralor
StepHypRef Expression
1 rexnal 3232 . . . 4 (∃𝑥𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥𝐴 𝜑)
2 rexnal 3232 . . . 4 (∃𝑦𝐵 ¬ 𝜓 ↔ ¬ ∀𝑦𝐵 𝜓)
31, 2anbi12i 629 . . 3 ((∃𝑥𝐴 ¬ 𝜑 ∧ ∃𝑦𝐵 ¬ 𝜓) ↔ (¬ ∀𝑥𝐴 𝜑 ∧ ¬ ∀𝑦𝐵 𝜓))
4 ioran 981 . . . . . . 7 (¬ (𝜑𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))
54rexbii 3241 . . . . . 6 (∃𝑦𝐵 ¬ (𝜑𝜓) ↔ ∃𝑦𝐵𝜑 ∧ ¬ 𝜓))
6 rexnal 3232 . . . . . 6 (∃𝑦𝐵 ¬ (𝜑𝜓) ↔ ¬ ∀𝑦𝐵 (𝜑𝜓))
75, 6bitr3i 280 . . . . 5 (∃𝑦𝐵𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑦𝐵 (𝜑𝜓))
87rexbii 3241 . . . 4 (∃𝑥𝐴𝑦𝐵𝜑 ∧ ¬ 𝜓) ↔ ∃𝑥𝐴 ¬ ∀𝑦𝐵 (𝜑𝜓))
9 reeanv 3358 . . . 4 (∃𝑥𝐴𝑦𝐵𝜑 ∧ ¬ 𝜓) ↔ (∃𝑥𝐴 ¬ 𝜑 ∧ ∃𝑦𝐵 ¬ 𝜓))
10 rexnal 3232 . . . 4 (∃𝑥𝐴 ¬ ∀𝑦𝐵 (𝜑𝜓) ↔ ¬ ∀𝑥𝐴𝑦𝐵 (𝜑𝜓))
118, 9, 103bitr3ri 305 . . 3 (¬ ∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∃𝑥𝐴 ¬ 𝜑 ∧ ∃𝑦𝐵 ¬ 𝜓))
12 ioran 981 . . 3 (¬ (∀𝑥𝐴 𝜑 ∨ ∀𝑦𝐵 𝜓) ↔ (¬ ∀𝑥𝐴 𝜑 ∧ ¬ ∀𝑦𝐵 𝜓))
133, 11, 123bitr4i 306 . 2 (¬ ∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ ¬ (∀𝑥𝐴 𝜑 ∨ ∀𝑦𝐵 𝜓))
1413con4bii 324 1 (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑 ∨ ∀𝑦𝐵 𝜓))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ wa 399   ∨ wo 844  ∀wral 3133  ∃wrex 3134 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 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-ral 3138  df-rex 3139 This theorem is referenced by:  prmidl2  31000  ispridl2  35424
 Copyright terms: Public domain W3C validator