| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infeq1 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.) |
| Ref | Expression |
|---|---|
| infeq1 | ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supeq1 9418 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅)) | |
| 2 | df-inf 9416 | . 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 3 | df-inf 9416 | . 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅) | |
| 4 | 1, 2, 3 | 3eqtr4g 2820 | 1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ◡ccnv 5654 supcsup 9413 infcinf 9414 |
| 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-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3916 df-uni 4868 df-sup 9415 df-inf 9416 |
| This theorem is used by: infeq1d 9451 infeq1i 9452 ramcl2lem 17104 odfval 19662 odval 19664 submod 19699 ioorval 25805 uniioombllem6 25819 infleinf 46204 infxrpnf 46277 prproropf1olem2 48407 prproropf1olem3 48408 prproropf1olem4 48409 prproropf1o 48410 prproropreud 48412 |
| Copyright terms: Public domain | W3C validator |