Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cleqh | Unicode version |
Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions. See also cleqf 2305. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
cleqh.1 | |
cleqh.2 |
Ref | Expression |
---|---|
cleqh |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfcleq 2133 | . 2 | |
2 | ax-17 1506 | . . . 4 | |
3 | dfbi2 385 | . . . . 5 | |
4 | cleqh.1 | . . . . . . 7 | |
5 | cleqh.2 | . . . . . . 7 | |
6 | 4, 5 | hbim 1524 | . . . . . 6 |
7 | 5, 4 | hbim 1524 | . . . . . 6 |
8 | 6, 7 | hban 1526 | . . . . 5 |
9 | 3, 8 | hbxfrbi 1448 | . . . 4 |
10 | eleq1 2202 | . . . . . 6 | |
11 | eleq1 2202 | . . . . . 6 | |
12 | 10, 11 | bibi12d 234 | . . . . 5 |
13 | 12 | biimpd 143 | . . . 4 |
14 | 2, 9, 13 | cbv3h 1721 | . . 3 |
15 | 12 | equcoms 1684 | . . . . 5 |
16 | 15 | biimprd 157 | . . . 4 |
17 | 9, 2, 16 | cbv3h 1721 | . . 3 |
18 | 14, 17 | impbii 125 | . 2 |
19 | 1, 18 | bitr4i 186 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wal 1329 wceq 1331 wcel 1480 |
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 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-cleq 2132 df-clel 2135 |
This theorem is referenced by: abeq2 2248 |
Copyright terms: Public domain | W3C validator |