Theorem r2alf 3287

Description: Double restricted universal quantification. For a version based on fewer axioms see r2al 3202. (Contributed by Mario Carneiro, 14-Oct-2016.) Use r2allem 3154. (Revised by Wolf Lammen, 9-Jan-2020.)

Hypothesis

Ref	Expression
r2alf.1	⊢ Ⅎ𝑦𝐴

Assertion

Ref	Expression
r2alf	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝜑))

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem r2alf

Step	Hyp	Ref	Expression
1		r2alf.1	. . . 4 ⊢ Ⅎ𝑦𝐴
2	1	nfcri 2918	. . 3 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴
3	2	19.21 2247	. 2 ⊢ (∀𝑦(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝜑)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 ∈ 𝐵 → 𝜑)))
4	3	r2allem 3154	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝜑))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-clel 2839  df-nfc 2913  df-ral 3081

This theorem is used by:  r2exf  3288  ralcomf  3304