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 8901 | . 2 ⊢ inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅) | |
2 | nfinf.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
3 | nfinf.2 | . . 3 ⊢ Ⅎ𝑥𝐵 | |
4 | nfinf.3 | . . . 4 ⊢ Ⅎ𝑥𝑅 | |
5 | 4 | nfcnv 5743 | . . 3 ⊢ Ⅎ𝑥◡𝑅 |
6 | 2, 3, 5 | nfsup 8909 | . 2 ⊢ Ⅎ𝑥sup(𝐴, 𝐵, ◡𝑅) |
7 | 1, 6 | nfcxfr 2975 | 1 ⊢ Ⅎ𝑥inf(𝐴, 𝐵, 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnfc 2961 ◡ccnv 5548 supcsup 8898 infcinf 8899 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-xp 5555 df-cnv 5557 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-sup 8900 df-inf 8901 |
This theorem is referenced by: iundisj 24143 iundisjf 30333 iundisjfi 30513 nfwsuc 33100 nfwlim 33104 allbutfiinf 41687 infrpgernmpt 41734 liminflelimsuplem 42049 stoweidlem62 42341 fourierdlem31 42417 iunhoiioolem 42951 smfinf 43086 prmdvdsfmtnof1lem1 43740 |
Copyright terms: Public domain | W3C validator |