| 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 5176 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 2 | nfe1 2188 | . . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) | |
| 3 | 2 | nfab 2933 | . 2 ⊢ Ⅎ𝑥{𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
| 4 | 1, 3 | nfcxfr 2925 | 1 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∃wex 1812 {cab 2743 Ⅎwnfc 2912 〈cop 4597 {copab 5175 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-opab 5176 |
| This theorem is used by: nfmpt1 5212 rexopabb 5514 ssopab2bw 5534 ssopab2b 5536 dmopab 5907 rnopab 5946 funopab 6575 fvopab5 7027 zfrep6OLD 7958 opabdm 33029 opabrn 33030 fpwrelmap 33150 fineqvrep 35586 bj-opabco 37891 vvdifopab 38974 aomclem8 43848 sprsymrelf 48304 |
| Copyright terms: Public domain | W3C validator |