MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfra2w Structured version   Visualization version   GIF version

Theorem nfra2w 3302
Description: Similar to Lemma 24 of [Monk2] p. 114, except that quantification is restricted. Once derived from hbra2VD 46163. 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
StepHypRef Expression
1 r2al 3202 . 2 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝜑))
2 nfa2 2213 . 2 Ⅎ𝑦∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝜑)
31, 2nfxfr 1886 1 Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568  Ⅎwnf 1816   ∈ wcel 2147  ∀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-10 2180  ax-11 2197
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-ral 3081
This theorem is used by:  invdisj  5094  reusv3  5374  dedekind  11512  dedekindle  11513  mreexexd  17872  gsummatr01lem4  23028  vieta  34323  ordtconnlem1  34667  bnj1379  35571  tratrb  45840  islptre  46965  sprsymrelfo  48913
  Copyright terms: Public domain W3C validator