Theorem nfra2w 3302

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

Assertion

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

Distinct variable groups:   𝑦,𝐴   𝑥,𝑦

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

Proof of Theorem nfra2w

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  Ⅎwnf 1815   ∈ wcel 2146  ∀wral 3080

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-10 2179  ax-11 2196

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-ral 3081

This theorem is used by:  invdisj  5092  reusv3  5371  dedekind  11486  dedekindle  11487  mreexexd  17837  gsummatr01lem4  22988  vieta  34268  ordtconnlem1  34612  bnj1379  35516  tratrb  45664  islptre  46776  sprsymrelfo  48724