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 5771 | . . 3 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
2 | supeq3 9138 | . . 3 ⊢ (◡𝑅 = ◡𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆)) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝑅 = 𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆)) |
4 | df-inf 9132 | . 2 ⊢ inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅) | |
5 | df-inf 9132 | . 2 ⊢ inf(𝐴, 𝐵, 𝑆) = sup(𝐴, 𝐵, ◡𝑆) | |
6 | 3, 4, 5 | 3eqtr4g 2804 | 1 ⊢ (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ◡ccnv 5579 supcsup 9129 infcinf 9130 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-in 3890 df-ss 3900 df-uni 4837 df-br 5071 df-opab 5133 df-cnv 5588 df-sup 9131 df-inf 9132 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |