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 4099 | . . 3 | |
2 | breq 3787 | . . . . . . . 8 | |
3 | breq 3787 | . . . . . . . 8 | |
4 | 2, 3 | anbi12d 456 | . . . . . . 7 |
5 | breq 3787 | . . . . . . 7 | |
6 | 4, 5 | imbi12d 232 | . . . . . 6 |
7 | 6 | ralbidv 2368 | . . . . 5 |
8 | 7 | ralbidv 2368 | . . . 4 |
9 | 8 | ralbidv 2368 | . . 3 |
10 | 1, 9 | anbi12d 456 | . 2 |
11 | df-wetr 4089 | . 2 | |
12 | df-wetr 4089 | . 2 | |
13 | 10, 11, 12 | 3bitr4g 221 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wceq 1284 wral 2348 class class class wbr 3785 wfr 4083 wwe 4085 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-4 1440 ax-17 1459 ax-ial 1467 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-cleq 2074 df-clel 2077 df-ral 2353 df-br 3786 df-frfor 4086 df-frind 4087 df-wetr 4089 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |