| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfsn | GIF version | ||
| Description: Bound-variable hypothesis builder for singletons. (Contributed by NM, 14-Nov-1995.) |
| Ref | Expression |
|---|---|
| nfsn.1 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| nfsn | ⊢ Ⅎ𝑥{𝐴} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsn2 3683 | . 2 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | nfsn.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 3 | 2, 2 | nfpr 3719 | . 2 ⊢ Ⅎ𝑥{𝐴, 𝐴} |
| 4 | 1, 3 | nfcxfr 2371 | 1 ⊢ Ⅎ𝑥{𝐴} |
| Colors of variables: wff set class |
| Syntax hints: Ⅎwnfc 2361 {csn 3669 {cpr 3670 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-un 3204 df-sn 3675 df-pr 3676 |
| This theorem is referenced by: nfop 3878 nfsuc 4505 sniota 5317 dfmpo 6387 |
| Copyright terms: Public domain | W3C validator |