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

Theorem raaanv 4276
Description: Rearrange restricted quantifiers. (Contributed by NM, 11-Mar-1997.)
Assertion
Ref Expression
raaanv (∀𝑥𝐴𝑦𝐴 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑 ∧ ∀𝑦𝐴 𝜓))
Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem raaanv
StepHypRef Expression
1 nfv 2005 . 2 𝑦𝜑
2 nfv 2005 . 2 𝑥𝜓
31, 2raaan 4275 1 (∀𝑥𝐴𝑦𝐴 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑 ∧ ∀𝑦𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wb 197  wa 384  wral 3096
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-ral 3101  df-v 3393  df-dif 3772  df-nul 4117
This theorem is referenced by:  reusv3i  5073  f1mpt  6738  isclo2  21103  ntrk2imkb  38832
  Copyright terms: Public domain W3C validator