| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infeq3 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.) |
| Ref | Expression |
|---|---|
| infeq3 | ⊢ (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnveq 5858 | . . 3 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
| 2 | supeq3 9407 | . . 3 ⊢ (◡𝑅 = ◡𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆)) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝑅 = 𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆)) |
| 4 | df-inf 9401 | . 2 ⊢ inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅) | |
| 5 | df-inf 9401 | . 2 ⊢ inf(𝐴, 𝐵, 𝑆) = sup(𝐴, 𝐵, ◡𝑆) | |
| 6 | 3, 4, 5 | 3eqtr4g 2822 | 1 ⊢ (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ◡ccnv 5659 supcsup 9398 infcinf 9399 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-ss 3921 df-uni 4872 df-br 5109 df-opab 5173 df-cnv 5668 df-sup 9400 df-inf 9401 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |