| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > supubti | Unicode version | ||
| Description: A supremum is an upper
bound. See also supclti 7240 and suplubti 7242.
This proof demonstrates how to expand an iota-based definition (df-iota 5293) using riotacl2 5996. (Contributed by Jim Kingdon, 24-Nov-2021.) |
| Ref | Expression |
|---|---|
| supmoti.ti |
|
| supclti.2 |
|
| Ref | Expression |
|---|---|
| supubti |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 |
. . . . 5
| |
| 2 | 1 | a1i 9 |
. . . 4
|
| 3 | 2 | ss2rabi 3310 |
. . 3
|
| 4 | supmoti.ti |
. . . . 5
| |
| 5 | supclti.2 |
. . . . 5
| |
| 6 | 4, 5 | supval2ti 7237 |
. . . 4
|
| 7 | 4, 5 | supeuti 7236 |
. . . . 5
|
| 8 | riotacl2 5996 |
. . . . 5
| |
| 9 | 7, 8 | syl 14 |
. . . 4
|
| 10 | 6, 9 | eqeltrd 2308 |
. . 3
|
| 11 | 3, 10 | sselid 3226 |
. 2
|
| 12 | breq2 4097 |
. . . . . . 7
| |
| 13 | 12 | notbid 673 |
. . . . . 6
|
| 14 | 13 | cbvralv 2768 |
. . . . 5
|
| 15 | breq1 4096 |
. . . . . . 7
| |
| 16 | 15 | notbid 673 |
. . . . . 6
|
| 17 | 16 | ralbidv 2533 |
. . . . 5
|
| 18 | 14, 17 | bitrid 192 |
. . . 4
|
| 19 | 18 | elrab 2963 |
. . 3
|
| 20 | 19 | simprbi 275 |
. 2
|
| 21 | breq2 4097 |
. . . 4
| |
| 22 | 21 | notbid 673 |
. . 3
|
| 23 | 22 | rspccv 2908 |
. 2
|
| 24 | 11, 20, 23 | 3syl 17 |
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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-un 3205 df-in 3207 df-ss 3214 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-iota 5293 df-riota 5981 df-sup 7226 |
| This theorem is referenced by: suplub2ti 7243 supisoti 7252 inflbti 7266 suprubex 9173 zsupcl 10537 dvdslegcd 12598 |
| Copyright terms: Public domain | W3C validator |