Theorem aaan 2170

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

Step	Hyp	Ref	Expression
1		aaan.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2	1	19.28 2096	. . 3 ⊢ (∀𝑦(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑦𝜓))
3	2	albii 1747	. 2 ⊢ (∀𝑥∀𝑦(𝜑 ∧ 𝜓) ↔ ∀𝑥(𝜑 ∧ ∀𝑦𝜓))
4		aaan.2	. . . 4 ⊢ Ⅎ𝑥𝜓
5	4	nfal 2153	. . 3 ⊢ Ⅎ𝑥∀𝑦𝜓
6	5	19.27 2095	. 2 ⊢ (∀𝑥(𝜑 ∧ ∀𝑦𝜓) ↔ (∀𝑥𝜑 ∧ ∀𝑦𝜓))
7	3, 6	bitri 264	1 ⊢ (∀𝑥∀𝑦(𝜑 ∧ 𝜓) ↔ (∀𝑥𝜑 ∧ ∀𝑦𝜓))

Syntax hints:   ↔ wb 196   ∧ wa 384  ∀wal 1481  Ⅎwnf 1708

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-nf 1710

This theorem is referenced by:  bj-mo3OLD  32832  aaanv  38588  pm11.71  38597