| 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 9360 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅)) | |
| 2 | df-inf 9358 | . 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 3 | df-inf 9358 | . 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅) | |
| 4 | 1, 2, 3 | 3eqtr4g 2797 | 1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ◡ccnv 5631 supcsup 9355 infcinf 9356 |
| 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-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-ss 3920 df-uni 4866 df-sup 9357 df-inf 9358 |
| This theorem is referenced by: infeq1d 9393 infeq1i 9394 ramcl2lem 16949 odfval 19473 odval 19475 submod 19510 ioorval 25543 uniioombllem6 25557 infleinf 45730 infxrpnf 45804 prproropf1olem2 47864 prproropf1olem3 47865 prproropf1olem4 47866 prproropf1o 47867 prproropreud 47869 |
| Copyright terms: Public domain | W3C validator |