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

Theorem infeq3 9497
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 5857 . . 3 (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆)
2 supeq3 9465 . . 3 (◡𝑅 = ◡𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆))
31, 2syl 18 . 2 (𝑅 = 𝑆 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐵, ◡𝑆))
4 df-inf 9459 . 2 inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅)
5 df-inf 9459 . 2 inf(𝐴, 𝐵, 𝑆) = sup(𝐴, 𝐵, ◡𝑆)
63, 4, 53eqtr4g 2823 1 (𝑅 = 𝑆 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐵, 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  ◡ccnv 5654  supcsup 9456  infcinf 9457
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-uni 4871  df-br 5107  df-opab 5171  df-cnv 5663  df-sup 9458  df-inf 9459
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator