Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > weeq1 | Unicode version |
Description: Equality theorem for the well-ordering predicate. (Contributed by NM, 9-Mar-1997.) |
Ref | Expression |
---|---|
weeq1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | freq1 4081 | . . 3 | |
2 | breq 3766 | . . . . . . . 8 | |
3 | breq 3766 | . . . . . . . 8 | |
4 | 2, 3 | anbi12d 442 | . . . . . . 7 |
5 | breq 3766 | . . . . . . 7 | |
6 | 4, 5 | imbi12d 223 | . . . . . 6 |
7 | 6 | ralbidv 2326 | . . . . 5 |
8 | 7 | ralbidv 2326 | . . . 4 |
9 | 8 | ralbidv 2326 | . . 3 |
10 | 1, 9 | anbi12d 442 | . 2 |
11 | df-wetr 4071 | . 2 | |
12 | df-wetr 4071 | . 2 | |
13 | 10, 11, 12 | 3bitr4g 212 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wceq 1243 wral 2306 class class class wbr 3764 wfr 4065 wwe 4067 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-4 1400 ax-17 1419 ax-ial 1427 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-cleq 2033 df-clel 2036 df-ral 2311 df-br 3765 df-frfor 4068 df-frind 4069 df-wetr 4071 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |