Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > supeq123d | Unicode version |
Description: Equality deduction for supremum. (Contributed by Stefan O'Rear, 20-Jan-2015.) |
Ref | Expression |
---|---|
supeq123d.a | |
supeq123d.b | |
supeq123d.c |
Ref | Expression |
---|---|
supeq123d |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supeq123d.b | . . . 4 | |
2 | supeq123d.a | . . . . . 6 | |
3 | supeq123d.c | . . . . . . . 8 | |
4 | 3 | breqd 3796 | . . . . . . 7 |
5 | 4 | notbid 624 | . . . . . 6 |
6 | 2, 5 | raleqbidv 2561 | . . . . 5 |
7 | 3 | breqd 3796 | . . . . . . 7 |
8 | 3 | breqd 3796 | . . . . . . . 8 |
9 | 2, 8 | rexeqbidv 2562 | . . . . . . 7 |
10 | 7, 9 | imbi12d 232 | . . . . . 6 |
11 | 1, 10 | raleqbidv 2561 | . . . . 5 |
12 | 6, 11 | anbi12d 456 | . . . 4 |
13 | 1, 12 | rabeqbidv 2596 | . . 3 |
14 | 13 | unieqd 3612 | . 2 |
15 | df-sup 6397 | . 2 | |
16 | df-sup 6397 | . 2 | |
17 | 14, 15, 16 | 3eqtr4g 2138 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 102 wceq 1284 wral 2348 wrex 2349 crab 2352 cuni 3601 class class class wbr 3785 csup 6395 |
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-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-rab 2357 df-uni 3602 df-br 3786 df-sup 6397 |
This theorem is referenced by: infeq123d 6429 |
Copyright terms: Public domain | W3C validator |