| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > preleq | Unicode version | ||
| Description: Equality of two unordered pairs when one member of each pair contains the other member. (Contributed by NM, 16-Oct-1996.) |
| Ref | Expression |
|---|---|
| preleq.1 |
|
| preleq.2 |
|
| preleq.3 |
|
| preleq.4 |
|
| Ref | Expression |
|---|---|
| preleq |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en2lp 4652 |
. . . . 5
| |
| 2 | eleq12 2296 |
. . . . . 6
| |
| 3 | 2 | anbi1d 465 |
. . . . 5
|
| 4 | 1, 3 | mtbiri 681 |
. . . 4
|
| 5 | 4 | con2i 632 |
. . 3
|
| 6 | 5 | adantr 276 |
. 2
|
| 7 | preleq.1 |
. . . . 5
| |
| 8 | preleq.2 |
. . . . 5
| |
| 9 | preleq.3 |
. . . . 5
| |
| 10 | preleq.4 |
. . . . 5
| |
| 11 | 7, 8, 9, 10 | preq12b 3853 |
. . . 4
|
| 12 | 11 | biimpi 120 |
. . 3
|
| 13 | 12 | adantl 277 |
. 2
|
| 14 | 6, 13 | ecased 1385 |
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-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 ax-setind 4635 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-v 2804 df-dif 3202 df-un 3204 df-sn 3675 df-pr 3676 |
| This theorem is referenced by: opthreg 4654 |
| Copyright terms: Public domain | W3C validator |