Theorem nfopab1 4112

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 4105	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
2		nfe1 1518	. . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
3	2	nfab 2352	. 2 ⊢ Ⅎ𝑥{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	1, 3	nfcxfr 2344	1 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}

Syntax hints:   ∧ wa 104   = wceq 1372  ∃wex 1514  {cab 2190  Ⅎwnfc 2334  ⟨cop 3635  {copab 4103

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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186

This theorem depends on definitions:  df-bi 117  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-opab 4105

This theorem is referenced by:  nfmpt1  4136  opelopabsb  4305  ssopab2b  4322  dmopab  4888  rnopab  4924  funopab  5305  0neqopab  5989