Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfinf | Structured version Visualization version GIF version |
Description: Hypothesis builder for infimum. (Contributed by AV, 2-Sep-2020.) |
Ref | Expression |
---|---|
nfinf.1 | ⊢ Ⅎ𝑥𝐴 |
nfinf.2 | ⊢ Ⅎ𝑥𝐵 |
nfinf.3 | ⊢ Ⅎ𝑥𝑅 |
Ref | Expression |
---|---|
nfinf | ⊢ Ⅎ𝑥inf(𝐴, 𝐵, 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-inf 9202 | . 2 ⊢ inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅) | |
2 | nfinf.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
3 | nfinf.2 | . . 3 ⊢ Ⅎ𝑥𝐵 | |
4 | nfinf.3 | . . . 4 ⊢ Ⅎ𝑥𝑅 | |
5 | 4 | nfcnv 5787 | . . 3 ⊢ Ⅎ𝑥◡𝑅 |
6 | 2, 3, 5 | nfsup 9210 | . 2 ⊢ Ⅎ𝑥sup(𝐴, 𝐵, ◡𝑅) |
7 | 1, 6 | nfcxfr 2905 | 1 ⊢ Ⅎ𝑥inf(𝐴, 𝐵, 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnfc 2887 ◡ccnv 5588 supcsup 9199 infcinf 9200 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-xp 5595 df-cnv 5597 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-sup 9201 df-inf 9202 |
This theorem is referenced by: iundisj 24712 iundisjf 30928 iundisjfi 31117 nfwsuc 33812 nfwlim 33816 allbutfiinf 42960 infrpgernmpt 43005 liminflelimsuplem 43316 stoweidlem62 43603 fourierdlem31 43679 iunhoiioolem 44213 smfinf 44351 prmdvdsfmtnof1lem1 45036 |
Copyright terms: Public domain | W3C validator |