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

Theorem aaan 2353
Description: Rearrange universal quantifiers. (Contributed by NM, 12-Aug-1993.)
Hypotheses
Ref Expression
aaan.1 𝑦𝜑
aaan.2 𝑥𝜓
Assertion
Ref Expression
aaan (∀𝑥𝑦(𝜑𝜓) ↔ (∀𝑥𝜑 ∧ ∀𝑦𝜓))

Proof of Theorem aaan
StepHypRef Expression
1 aaan.1 . . . 4 𝑦𝜑
2119.28 2230 . . 3 (∀𝑦(𝜑𝜓) ↔ (𝜑 ∧ ∀𝑦𝜓))
32albii 1820 . 2 (∀𝑥𝑦(𝜑𝜓) ↔ ∀𝑥(𝜑 ∧ ∀𝑦𝜓))
4 aaan.2 . . . 4 𝑥𝜓
54nfal 2342 . . 3 𝑥𝑦𝜓
6519.27 2229 . 2 (∀𝑥(𝜑 ∧ ∀𝑦𝜓) ↔ (∀𝑥𝜑 ∧ ∀𝑦𝜓))
73, 6bitri 277 1 (∀𝑥𝑦(𝜑𝜓) ↔ (∀𝑥𝜑 ∧ ∀𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wal 1535  wnf 1784
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2145  ax-11 2161  ax-12 2177
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-nf 1785
This theorem is referenced by:  aaanv  40727  pm11.71  40736
  Copyright terms: Public domain W3C validator