Theorem 2ralbida 3196

Description: Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 24-Feb-2004.)

Hypotheses

Ref	Expression
2ralbida.1	⊢ Ⅎ𝑥𝜑
2ralbida.2	⊢ Ⅎ𝑦𝜑
2ralbida.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
2ralbida	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒))

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑥,𝑦)

Proof of Theorem 2ralbida

Step	Hyp	Ref	Expression
1		2ralbida.1	. 2 ⊢ Ⅎ𝑥𝜑
2		2ralbida.2	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfv 1915	. . . 4 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴
4	2, 3	nfan 1900	. . 3 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 ∈ 𝐴)
5		2ralbida.3	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝜓 ↔ 𝜒))
6	5	anassrs 471	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝜓 ↔ 𝜒))
7	4, 6	ralbida 3194	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒))
8	1, 7	ralbida 3194	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  Ⅎwnf 1785   ∈ wcel 2111  ∀wral 3106

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-12 2175

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-ral 3111

This theorem is referenced by: (None)