MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infeq3 Structured version   Visualization version   GIF version

Theorem infeq3 9429
Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.)
Assertion
Ref Expression
infeq3 (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆))

Proof of Theorem infeq3
StepHypRef Expression
1 cnveq 5847 . . 3 (𝑅 = 𝑆𝑅 = 𝑆)
2 supeq3 9397 . . 3 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
31, 2syl 17 . 2 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
4 df-inf 9391 . 2 inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑅)
5 df-inf 9391 . 2 inf(𝐴, 𝐵, 𝑆) = sup(𝐴, 𝐵, 𝑆)
63, 4, 53eqtr4g 2824 1 (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1562  ccnv 5648  supcsup 9388  infcinf 9389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1565  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-ss 3923  df-uni 4868  df-br 5103  df-opab 5165  df-cnv 5657  df-sup 9390  df-inf 9391
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator