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

Theorem infeq3 9010
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 5710 . . 3 (𝑅 = 𝑆𝑅 = 𝑆)
2 supeq3 8979 . . 3 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
31, 2syl 17 . 2 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
4 df-inf 8973 . 2 inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑅)
5 df-inf 8973 . 2 inf(𝐴, 𝐵, 𝑆) = sup(𝐴, 𝐵, 𝑆)
63, 4, 53eqtr4g 2798 1 (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  ccnv 5518  supcsup 8970  infcinf 8971
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-ext 2710
This theorem depends on definitions:  df-bi 210  df-an 400  df-tru 1545  df-ex 1787  df-sb 2074  df-clab 2717  df-cleq 2730  df-clel 2811  df-ral 3058  df-rex 3059  df-rab 3062  df-v 3399  df-in 3848  df-ss 3858  df-uni 4794  df-br 5028  df-opab 5090  df-cnv 5527  df-sup 8972  df-inf 8973
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator