| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqssi | Unicode version | ||
| Description: Infer equality from two subclass relationships. Compare Theorem 4 of [Suppes] p. 22. (Contributed by NM, 9-Sep-1993.) |
| Ref | Expression |
|---|---|
| eqssi.1 |
|
| eqssi.2 |
|
| Ref | Expression |
|---|---|
| eqssi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqssi.1 |
. 2
| |
| 2 | eqssi.2 |
. 2
| |
| 3 | eqss 3243 |
. 2
| |
| 4 | 1, 2, 3 | mpbir2an 951 |
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 106 ax-ia2 107 ax-ia3 108 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-in 3207 df-ss 3214 |
| This theorem is referenced by: inv1 3533 unv 3534 undifabs 3573 intab 3962 intid 4322 find 4703 limom 4718 dmv 4953 0ima 5103 rnxpid 5178 dftpos4 6472 axaddf 8148 axmulf 8149 dfuzi 9651 unirnioo 10269 0bits 12600 4sqlem19 13062 txuni2 15067 dvef 15538 reeff1o 15584 |
| Copyright terms: Public domain | W3C validator |