HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem raaan 1775
Description: Rearrange restricted quantifiers.
Assertion
Ref Expression
raaan (∀xAyA (φψ) ↔ (∀xA φ ∧ ∀yA ψ))
Distinct variable group(s):   φ,y   ψ,x   x,y,A

Proof of Theorem raaan
StepHypRef Expression
1 pm5.1 501 . . 3 ((∀xAyA (φψ) ∧ (∀xA φ ∧ ∀yA ψ)) → (∀xAyA (φψ) ↔ (∀xA φ ∧ ∀yA ψ)))
2 rzal 1773 . . 3 (A = ∅ → ∀xAyA (φψ))
3 rzal 1773 . . . 4 (A = ∅ → ∀xA φ)
4 rzal 1773 . . . 4 (A = ∅ → ∀yA ψ)
53, 4jca 236 . . 3 (A = ∅ → (∀xA φ ∧ ∀yA ψ))
61, 2, 5sylanc 361 . 2 (A = ∅ → (∀xAyA (φψ) ↔ (∀xA φ ∧ ∀yA ψ)))
7 r19.3rzv 1767 . . . . . 6 A = ∅ → (φ ↔ ∀yA φ))
87anbi1d 469 . . . . 5 A = ∅ → ((φ ∧ ∀yA ψ) ↔ (∀yA φ ∧ ∀yA ψ)))
9 r19.26 1289 . . . . 5 (∀yA (φψ) ↔ (∀yA φ ∧ ∀yA ψ))
108, 9syl6rbbr 417 . . . 4 A = ∅ → (∀yA (φψ) ↔ (φ ∧ ∀yA ψ)))
1110biraldv 1219 . . 3 A = ∅ → (∀xAyA (φψ) ↔ ∀xA (φ ∧ ∀yA ψ)))
12 r19.3rzv 1767 . . . . 5 A = ∅ → (∀yA ψ ↔ ∀xAyA ψ))
1312anbi2d 468 . . . 4 A = ∅ → ((∀xA φ ∧ ∀yA ψ) ↔ (∀xA φ ∧ ∀xAyA ψ)))
14 r19.26 1289 . . . 4 (∀xA (φ ∧ ∀yA ψ) ↔ (∀xA φ ∧ ∀xAyA ψ))
1513, 14syl6rbbr 417 . . 3 A = ∅ → (∀xA (φ ∧ ∀yA ψ) ↔ (∀xA φ ∧ ∀yA ψ)))
1611, 15bitrd 406 . 2 A = ∅ → (∀xAyA (φψ) ↔ (∀xA φ ∧ ∀yA ψ)))
176, 16pm2.61i 110 1 (∀xAyA (φψ) ↔ (∀xA φ ∧ ∀yA ψ))
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   ↔ wb 127   ∧ wa 196   = wceq 1091  ∀wral 1201  ∅c0 1707
This theorem is referenced by:  hlimcaui 5141
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-v 1349  df-dif 1489  df-nul 1708
metamath.org