Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > infex | Structured version Visualization version GIF version |
Description: An infimum is a set. (Contributed by AV, 3-Sep-2020.) |
Ref | Expression |
---|---|
infex.1 | ⊢ 𝑅 Or 𝐴 |
Ref | Expression |
---|---|
infex | ⊢ inf(𝐵, 𝐴, 𝑅) ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infex.1 | . 2 ⊢ 𝑅 Or 𝐴 | |
2 | id 22 | . . 3 ⊢ (𝑅 Or 𝐴 → 𝑅 Or 𝐴) | |
3 | 2 | infexd 8941 | . 2 ⊢ (𝑅 Or 𝐴 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
4 | 1, 3 | ax-mp 5 | 1 ⊢ inf(𝐵, 𝐴, 𝑅) ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2110 Vcvv 3494 Or wor 5467 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 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 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-ne 3017 df-ral 3143 df-rex 3144 df-rmo 3146 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-po 5468 df-so 5469 df-cnv 5557 df-sup 8900 df-inf 8901 |
This theorem is referenced by: limsupval 14825 lcmval 15930 odzval 16122 ramval 16338 imasdsfn 16781 imasdsval 16782 odval 18656 odf 18659 gexval 18697 nmoval 23318 metdsval 23449 ovolval 24068 ovolf 24077 elqaalem1 24902 elqaalem3 24904 ballotlemi 31753 pellfundval 39470 dgraaval 39737 dgraaf 39740 liminfgval 42036 liminfval2 42042 ovnval2 42821 |
Copyright terms: Public domain | W3C validator |