| 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 9479 | . 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 2144 Vcvv 3450 Or wor 5557 infcinf 9436 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-po 5558 df-so 5559 df-cnv 5658 df-sup 9437 df-inf 9438 |
| This theorem is used by: limsupval 15646 lcmval 16772 odzval 16974 ramval 17191 imasdsfn 17691 imasdsval 17692 odval 19753 odf 19756 gexval 19797 nmoval 25039 metdsval 25172 ovolval 25799 ovolf 25808 elqaalem1 26647 elqaalem3 26649 ballotlemi 35179 frlmnzcoordval 43746 pellfundval 43980 dgraaval 44239 dgraaf 44242 liminfgval 46865 liminfval2 46871 ovnval2 47648 finfdm2 47950 |
| Copyright terms: Public domain | W3C validator |