Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > infnlb | Structured version Visualization version Unicode version |
Description: A lower bound is not greater than the infimum. (Contributed by AV, 3-Sep-2020.) |
Ref | Expression |
---|---|
infcl.1 | |
infcl.2 |
Ref | Expression |
---|---|
infnlb | inf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infcl.1 | . . . . . 6 | |
2 | infcl.2 | . . . . . 6 | |
3 | 1, 2 | infglb 8396 | . . . . 5 inf |
4 | 3 | expdimp 453 | . . . 4 inf |
5 | dfrex2 2996 | . . . 4 | |
6 | 4, 5 | syl6ib 241 | . . 3 inf |
7 | 6 | con2d 129 | . 2 inf |
8 | 7 | expimpd 629 | 1 inf |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wa 384 wcel 1990 wral 2912 wrex 2913 class class class wbr 4653 wor 5034 infcinf 8347 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-po 5035 df-so 5036 df-cnv 5122 df-iota 5851 df-riota 6611 df-sup 8348 df-inf 8349 |
This theorem is referenced by: infssd 29488 |
Copyright terms: Public domain | W3C validator |