| 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 3263 |
. 2
| |
| 4 | 1, 2, 3 | mpbir2an 955 |
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 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-11 1559 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-in 3226 df-ss 3233 |
| This theorem is referenced by: inv1 3559 unv 3560 undifabs 3601 intab 3994 intid 4359 find 4741 limom 4756 dmv 4992 0ima 5142 rnxpid 5217 rinvf1o 6025 dftpos4 6524 axaddf 8225 axmulf 8226 dfuzi 9735 unirnioo 10354 0bits 12704 4sqlem19 13166 ballotfilemth 13259 txuni2 15280 dvef 15751 reeff1o 15797 |
| Copyright terms: Public domain | W3C validator |