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 6880 | . . . . 5 inf |
4 | 3 | expdimp 257 | . . . 4 inf |
5 | rexalim 2407 | . . . 4 | |
6 | 4, 5 | syl6 33 | . . 3 inf |
7 | 6 | con2d 598 | . 2 inf |
8 | 7 | expimpd 360 | 1 inf |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wb 104 wcel 1465 wral 2393 wrex 2394 class class class wbr 3899 infcinf 6838 |
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 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-rex 2399 df-reu 2400 df-rmo 2401 df-rab 2402 df-v 2662 df-sbc 2883 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-cnv 4517 df-iota 5058 df-riota 5698 df-sup 6839 df-inf 6840 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |