| 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 9346 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅)) | |
| 2 | df-inf 9344 | . 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 3 | df-inf 9344 | . 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅) | |
| 4 | 1, 2, 3 | 3eqtr4g 2794 | 1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ◡ccnv 5621 supcsup 9341 infcinf 9342 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-ss 3916 df-uni 4862 df-sup 9343 df-inf 9344 |
| This theorem is referenced by: infeq1d 9379 infeq1i 9380 ramcl2lem 16935 odfval 19459 odval 19461 submod 19496 ioorval 25529 uniioombllem6 25543 infleinf 45558 infxrpnf 45632 prproropf1olem2 47692 prproropf1olem3 47693 prproropf1olem4 47694 prproropf1o 47695 prproropreud 47697 |
| Copyright terms: Public domain | W3C validator |