Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfoprab1 | GIF version |
Description: The abstraction variables in an operation class abstraction are not free. (Contributed by NM, 25-Apr-1995.) (Revised by David Abernethy, 19-Jun-2012.) |
Ref | Expression |
---|---|
nfoprab1 | ⊢ Ⅎ𝑥{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-oprab 5516 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑)} | |
2 | nfe1 1385 | . . 3 ⊢ Ⅎ𝑥∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑) | |
3 | 2 | nfab 2182 | . 2 ⊢ Ⅎ𝑥{𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑)} |
4 | 1, 3 | nfcxfr 2175 | 1 ⊢ Ⅎ𝑥{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} |
Colors of variables: wff set class |
Syntax hints: ∧ wa 97 = wceq 1243 ∃wex 1381 {cab 2026 Ⅎwnfc 2165 〈cop 3378 {coprab 5513 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-oprab 5516 |
This theorem is referenced by: ssoprab2b 5562 nfmpt21 5571 ovi3 5637 tposoprab 5895 |
Copyright terms: Public domain | W3C validator |