| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfsn2 | GIF version | ||
| Description: Alternate definition of singleton. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by NM, 24-Apr-1994.) |
| Ref | Expression |
|---|---|
| dfsn2 | ⊢ {𝐴} = {𝐴, 𝐴} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pr 3696 | . 2 ⊢ {𝐴, 𝐴} = ({𝐴} ∪ {𝐴}) | |
| 2 | unidm 3362 | . 2 ⊢ ({𝐴} ∪ {𝐴}) = {𝐴} | |
| 3 | 1, 2 | eqtr2i 2254 | 1 ⊢ {𝐴} = {𝐴, 𝐴} |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∪ cun 3209 {csn 3689 {cpr 3690 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2815 df-un 3215 df-pr 3696 |
| This theorem is referenced by: nfsn 3749 tpidm12 3790 tpidm 3793 ifpprsnssdc 3799 preqsn 3879 opid 3901 unisn 3930 intsng 3983 vsnex 4324 opeqsn 4369 relop 4905 funopg 5386 funopsn 5860 enpr1g 7038 prfidceq 7188 hashprg 11173 hashtpgim 11217 hashtpglem 11218 upgrex 16098 umgrnloop0 16112 1loopgruspgr 16298 ifpsnprss 16338 upgriswlkdc 16355 clwwlkn1 16413 bj-snexg 16682 |
| Copyright terms: Public domain | W3C validator |