| 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 9460 | . 2 ⊢ (𝑅 Or 𝐴 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ inf(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 Vcvv 3451 Or wor 5558 infcinf 9417 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-po 5559 df-so 5560 df-cnv 5659 df-sup 9418 df-inf 9419 |
| This theorem is used by: limsupval 15621 lcmval 16747 odzval 16949 ramval 17166 imasdsfn 17666 imasdsval 17667 odval 19728 odf 19731 gexval 19772 nmoval 25014 metdsval 25147 ovolval 25774 ovolf 25783 elqaalem1 26624 elqaalem3 26626 ballotlemi 35116 pellfundval 43840 dgraaval 44104 dgraaf 44107 liminfgval 46716 liminfval2 46722 ovnval2 47499 finfdm2 47801 |
| Copyright terms: Public domain | W3C validator |