Theorem nfopab1 4067

Description: The first abstraction variable in an ordered-pair class abstraction (class builder) is effectively not free. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)

Assertion

Ref	Expression
nfopab1	⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem nfopab1

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-opab 4060	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
2		nfe1 1494	. . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
3	2	nfab 2322	. 2 ⊢ Ⅎ𝑥{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	1, 3	nfcxfr 2314	1 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}

Syntax hints:   ∧ wa 104   = wceq 1353  ∃wex 1490  {cab 2161  Ⅎwnfc 2304  ⟨cop 3592  {copab 4058

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157

This theorem depends on definitions:  df-bi 117  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-opab 4060

This theorem is referenced by:  nfmpt1  4091  opelopabsb  4254  ssopab2b  4270  dmopab  4831  rnopab  4867  funopab  5243  0neqopab  5910