| 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 5163 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 2 | nfe1 2184 | . . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) | |
| 3 | 2 | nfab 2930 | . 2 ⊢ Ⅎ𝑥{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 4 | 1, 3 | nfcxfr 2922 | 1 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 = wceq 1560 ∃wex 1799 {cab 2740 Ⅎwnfc 2909 〈cop 4588 {copab 5162 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-opab 5163 |
| This theorem is referenced by: nfmpt1 5199 rexopabb 5498 ssopab2bw 5518 ssopab2b 5520 dmopab 5891 rnopab 5930 funopab 6556 fvopab5 7009 zfrep6OLD 7936 opabdm 32813 opabrn 32814 fpwrelmap 32935 fineqvrep 35410 bj-opabco 37680 vvdifopab 38764 aomclem8 43638 sprsymrelf 48101 |
| Copyright terms: Public domain | W3C validator |