Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfopab | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for class abstraction. (Contributed by NM, 1-Sep-1999.) Remove disjoint variable conditions. (Revised by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
nfopab.1 | ⊢ Ⅎ𝑧𝜑 |
Ref | Expression |
---|---|
nfopab | ⊢ Ⅎ𝑧{〈𝑥, 𝑦〉 ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-opab 5100 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
2 | nfv 1916 | . . . . . 6 ⊢ Ⅎ𝑧 𝑤 = 〈𝑥, 𝑦〉 | |
3 | nfopab.1 | . . . . . 6 ⊢ Ⅎ𝑧𝜑 | |
4 | 2, 3 | nfan 1901 | . . . . 5 ⊢ Ⅎ𝑧(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
5 | 4 | nfex 2333 | . . . 4 ⊢ Ⅎ𝑧∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
6 | 5 | nfex 2333 | . . 3 ⊢ Ⅎ𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
7 | 6 | nfab 2926 | . 2 ⊢ Ⅎ𝑧{𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
8 | 1, 7 | nfcxfr 2918 | 1 ⊢ Ⅎ𝑧{〈𝑥, 𝑦〉 ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 = wceq 1539 ∃wex 1782 Ⅎwnf 1786 {cab 2736 Ⅎwnfc 2900 〈cop 4532 {copab 5099 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2071 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-opab 5100 |
This theorem is referenced by: nfmpt 5134 csbopab 5417 csbopabgALT 5418 nfxp 5562 nfco 5712 nfcnv 5725 nfofr 7418 |
Copyright terms: Public domain | W3C validator |