| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfopab1 | Structured version Visualization version GIF version | ||
| Description: The first 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.) |
| Ref | Expression |
|---|---|
| nfopab1 | ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-opab 5159 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 2 | nfe1 2155 | . . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) | |
| 3 | 2 | nfab 2902 | . 2 ⊢ Ⅎ𝑥{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 4 | 1, 3 | nfcxfr 2894 | 1 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1541 ∃wex 1780 {cab 2712 Ⅎwnfc 2881 〈cop 4584 {copab 5158 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-opab 5159 |
| This theorem is referenced by: nfmpt1 5195 rexopabb 5474 ssopab2bw 5493 ssopab2b 5495 dmopab 5862 rnopab 5901 funopab 6525 fvopab5 6972 zfrep6 7897 opabdm 32638 opabrn 32639 fpwrelmap 32761 fineqvrep 35219 bj-opabco 37332 vvdifopab 38397 aomclem8 43245 sprsymrelf 47683 |
| Copyright terms: Public domain | W3C validator |