| 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 9397 | . 2 ⊢ (𝑅 Or 𝐴 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ inf(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 Vcvv 3429 Or wor 5538 infcinf 9354 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-po 5539 df-so 5540 df-cnv 5639 df-sup 9355 df-inf 9356 |
| This theorem is referenced by: limsupval 15436 lcmval 16561 odzval 16762 ramval 16979 imasdsfn 17478 imasdsval 17479 odval 19509 odf 19512 gexval 19553 nmoval 24680 metdsval 24813 ovolval 25440 ovolf 25449 elqaalem1 26285 elqaalem3 26287 ballotlemi 34645 pellfundval 43308 dgraaval 43572 dgraaf 43575 liminfgval 46190 liminfval2 46196 ovnval2 46973 finfdm2 47275 |
| Copyright terms: Public domain | W3C validator |