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

Theorem raaanv 4477
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 rzal 4452 . . 3 (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓))
2 rzal 4452 . . 3 (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)
3 rzal 4452 . . 3 (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝜓)
4 pm5.1 836 . . 3 ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
51, 2, 3, 4syl12anc 850 . 2 (𝐴 = ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
6 r19.28zv 4464 . . . 4 (𝐴 ≠ ∅ → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
76ralbidv 3192 . . 3 (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
8 r19.27zv 4469 . . 3 (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
97, 8bitrd 282 . 2 (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
105, 9pm2.61ine 3045 1 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1572   ≠ wne 2962  ∀wral 3083  ∅c0 4280
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-9 2160  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-ne 2963  df-ral 3084  df-dif 4049  df-nul 4281
This theorem is used by:  reusv3i  5372  f1mpt  7295  isclo2  23463  ntrk2imkb  45358
  Copyright terms: Public domain W3C validator