Theorem raaan 4479

Description: Rearrange restricted quantifiers. (Contributed by NM, 26-Oct-2010.)

Hypotheses

Ref	Expression
raaan.1	⊢ Ⅎ𝑦𝜑
raaan.2	⊢ Ⅎ𝑥𝜓

Assertion

Ref	Expression
raaan	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓))

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem raaan

Step	Hyp	Ref	Expression
1		rzal 4455	. . 3 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓))
2		rzal 4455	. . 3 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)
3		rzal 4455	. . 3 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝜓)
4		pm5.1 835	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
5	1, 2, 3, 4	syl12anc 849	. 2 ⊢ (𝐴 = ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
6		raaan.1	. . . . 5 ⊢ Ⅎ𝑦𝜑
7	6	r19.28z 4463	. . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
8	7	ralbidv 3188	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
9		nfcv 2925	. . . . 5 ⊢ Ⅎ𝑥𝐴
10		raaan.2	. . . . 5 ⊢ Ⅎ𝑥𝜓
11	9, 10	nfralw 3312	. . . 4 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓
12	11	r19.27z 4471	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
13	8, 12	bitrd 282	. 2 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)))
14	5, 13	pm2.61ine 3041	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   = wceq 1570  Ⅎwnf 1813   ≠ wne 2958  ∀wral 3079  ∅c0 4286

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-dif 3908  df-nul 4287

This theorem is used by: (None)