![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 1ex | Unicode version |
Description: 1 is a set. Common special case. (Contributed by David A. Wheeler, 7-Jul-2016.) |
Ref | Expression |
---|---|
1ex |
![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-1cn 7737 |
. 2
![]() ![]() ![]() ![]() | |
2 | 1 | elexi 2701 |
1
![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
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-5 1424 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-ext 2122 ax-1cn 7737 |
This theorem depends on definitions: df-bi 116 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-v 2691 |
This theorem is referenced by: nn1suc 8763 nn0ind-raph 9192 fzprval 9893 fztpval 9894 m1expcl2 10346 1exp 10353 facnn 10505 fac0 10506 prhash2ex 10587 prodf1f 11344 ege2le3 11414 1nprm 11831 dvexp 12883 dvef 12896 2o01f 13364 |
Copyright terms: Public domain | W3C validator |