Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > seeq1 | Unicode version |
Description: Equality theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.) |
Ref | Expression |
---|---|
seeq1 | Se Se |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqimss2 3202 | . . 3 | |
2 | sess1 4322 | . . 3 Se Se | |
3 | 1, 2 | syl 14 | . 2 Se Se |
4 | eqimss 3201 | . . 3 | |
5 | sess1 4322 | . . 3 Se Se | |
6 | 4, 5 | syl 14 | . 2 Se Se |
7 | 3, 6 | impbid 128 | 1 Se Se |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1348 wss 3121 Se wse 4314 |
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 ax-sep 4107 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rab 2457 df-v 2732 df-in 3127 df-ss 3134 df-br 3990 df-se 4318 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |