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

Theorem 2ralbiim 3102
Description: Split a biconditional and distribute two restricted universal quantifiers, analogous to 2albiim 1897 and ralbiim 3101. (Contributed by Alexander van der Vekens, 2-Jul-2017.)
Assertion
Ref Expression
2ralbiim (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ∧ ∀𝑥𝐴𝑦𝐵 (𝜓𝜑)))

Proof of Theorem 2ralbiim
StepHypRef Expression
1 ralbiim 3101 . . 3 (∀𝑦𝐵 (𝜑𝜓) ↔ (∀𝑦𝐵 (𝜑𝜓) ∧ ∀𝑦𝐵 (𝜓𝜑)))
21ralbii 3093 . 2 (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ ∀𝑥𝐴 (∀𝑦𝐵 (𝜑𝜓) ∧ ∀𝑦𝐵 (𝜓𝜑)))
3 r19.26 3097 . 2 (∀𝑥𝐴 (∀𝑦𝐵 (𝜑𝜓) ∧ ∀𝑦𝐵 (𝜓𝜑)) ↔ (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ∧ ∀𝑥𝐴𝑦𝐵 (𝜓𝜑)))
42, 3bitri 274 1 (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ↔ (∀𝑥𝐴𝑦𝐵 (𝜑𝜓) ∧ ∀𝑥𝐴𝑦𝐵 (𝜓𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wral 3066
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816
This theorem depends on definitions:  df-bi 206  df-an 397  df-ral 3071
This theorem is referenced by:  thincciso  46309
  Copyright terms: Public domain W3C validator