| 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 9404 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅)) | |
| 2 | df-inf 9402 | . 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 3 | df-inf 9402 | . 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅) | |
| 4 | 1, 2, 3 | 3eqtr4g 2821 | 1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1568 ◡ccnv 5660 supcsup 9399 infcinf 9400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1571 df-ex 1808 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 df-ss 3921 df-uni 4872 df-sup 9401 df-inf 9402 |
| This theorem is referenced by: infeq1d 9437 infeq1i 9438 ramcl2lem 17068 odfval 19601 odval 19603 submod 19638 ioorval 25712 uniioombllem6 25726 infleinf 46035 infxrpnf 46108 prproropf1olem2 48198 prproropf1olem3 48199 prproropf1olem4 48200 prproropf1o 48201 prproropreud 48203 |
| Copyright terms: Public domain | W3C validator |