Theorem nfra2w

Description: Similar to Lemma 24 of Monk2 p. 114, except that quantification is restricted. Once derived from hbra2VD . Version of nfra2 with a disjoint variable condition not requiring ax-13 . (Contributed by Alan Sare, 31-Dec-2011) Reduce axiom usage. (Revised by GG, 24-Sep-2024) (Proof shortened by Wolf Lammen, 3-Jan-2025)

	Ref	Expression
Assertion	nfra2w	⊢ Ⅎ 𝑦 ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑

Proof

Step	Hyp	Ref	Expression
1		r2al	⊢ ( ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑 ↔ ∀ 𝑥 ∀ 𝑦 ( ( 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ) → 𝜑 ) )
2		nfa2	⊢ Ⅎ 𝑦 ∀ 𝑥 ∀ 𝑦 ( ( 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ) → 𝜑 )
3	1 2	nfxfr	⊢ Ⅎ 𝑦 ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑