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

Theorem nfopab2 5179
Description: The second abstraction variable in an ordered-pair class abstraction is effectively not free. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
nfopab2 Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem nfopab2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-opab 5171 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
2 nfe1 2190 . . . 4 Ⅎ𝑦∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
32nfex 2358 . . 3 Ⅎ𝑦∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfab 2932 . 2 Ⅎ𝑦{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
51, 4nfcxfr 2924 1 Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812  {cab 2741  Ⅎwnfc 2911  ⟨cop 4838  {copab 5170
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-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-opab 5171
This theorem is used by:  rexopabb  5506  ssopab2bw  5526  ssopab2b  5528  dmopab  5903  rnopab  5942  funopab  6592  fvopab5  7047  zfrep6OLD  7988  opabdm  33274  opabrn  33275  fpwrelmap  33392  rankse  35822  fineqvrep  35881  srepdflem2  36085  bj-opabco  38300  vvdifopab  39388  aomclem8  44254  areaquad  44408  modelaxrep  46164  sprsymrelf  48780
  Copyright terms: Public domain W3C validator