| 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 23 | . . 3 ⊢ (𝑅 Or 𝐴 → 𝑅 Or 𝐴) | |
| 3 | 2 | infexd 9432 | . 2 ⊢ (𝑅 Or 𝐴 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ inf(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2145 Vcvv 3457 Or wor 5559 infcinf 9389 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-po 5560 df-so 5561 df-cnv 5660 df-sup 9390 df-inf 9391 |
| This theorem is referenced by: limsupval 15515 lcmval 16640 odzval 16841 ramval 17058 imasdsfn 17558 imasdsval 17559 odval 19595 odf 19598 gexval 19639 nmoval 24833 metdsval 24966 ovolval 25593 ovolf 25602 elqaalem1 26441 elqaalem3 26443 ballotlemi 34808 pellfundval 43469 dgraaval 43733 dgraaf 43736 liminfgval 46334 liminfval2 46340 ovnval2 47117 finfdm2 47419 |
| Copyright terms: Public domain | W3C validator |