Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > infeq1 | Structured version Visualization version Unicode version |
Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.) |
Ref | Expression |
---|---|
infeq1 | inf inf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supeq1 8351 | . 2 | |
2 | df-inf 8349 | . 2 inf | |
3 | df-inf 8349 | . 2 inf | |
4 | 1, 2, 3 | 3eqtr4g 2681 | 1 inf inf |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wceq 1483 ccnv 5113 csup 8346 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 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-uni 4437 df-sup 8348 df-inf 8349 |
This theorem is referenced by: infeq1d 8383 infeq1i 8384 ramcl2lem 15713 odval 17953 submod 17984 ioorval 23342 uniioombllem6 23356 infleinf 39588 infxrpnf 39674 |
Copyright terms: Public domain | W3C validator |