Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > infnlbti | Unicode version |
Description: A lower bound is not greater than the infimum. (Contributed by Jim Kingdon, 18-Dec-2021.) |
Ref | Expression |
---|---|
infclti.ti | |
infclti.ex |
Ref | Expression |
---|---|
infnlbti | inf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infclti.ti | . . . . . 6 | |
2 | infclti.ex | . . . . . 6 | |
3 | 1, 2 | infglbti 6990 | . . . . 5 inf |
4 | 3 | expdimp 257 | . . . 4 inf |
5 | rexalim 2459 | . . . 4 | |
6 | 4, 5 | syl6 33 | . . 3 inf |
7 | 6 | con2d 614 | . 2 inf |
8 | 7 | expimpd 361 | 1 inf |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wb 104 wcel 2136 wral 2444 wrex 2445 class class class wbr 3982 infcinf 6948 |
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-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-cnv 4612 df-iota 5153 df-riota 5798 df-sup 6949 df-inf 6950 |
This theorem is referenced by: infregelbex 9536 |
Copyright terms: Public domain | W3C validator |