Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfopab | 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 4051 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
2 | nfv 1521 | . . . . . 6 ⊢ Ⅎ𝑧 𝑤 = 〈𝑥, 𝑦〉 | |
3 | nfopab.1 | . . . . . 6 ⊢ Ⅎ𝑧𝜑 | |
4 | 2, 3 | nfan 1558 | . . . . 5 ⊢ Ⅎ𝑧(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
5 | 4 | nfex 1630 | . . . 4 ⊢ Ⅎ𝑧∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
6 | 5 | nfex 1630 | . . 3 ⊢ Ⅎ𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
7 | 6 | nfab 2317 | . 2 ⊢ Ⅎ𝑧{𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} |
8 | 1, 7 | nfcxfr 2309 | 1 ⊢ Ⅎ𝑧{〈𝑥, 𝑦〉 ∣ 𝜑} |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1348 Ⅎwnf 1453 ∃wex 1485 {cab 2156 Ⅎwnfc 2299 〈cop 3586 {copab 4049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-opab 4051 |
This theorem is referenced by: csbopabg 4067 nfmpt 4081 nfxp 4638 nfco 4776 nfcnv 4790 nfofr 6067 |
Copyright terms: Public domain | W3C validator |