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

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

Proof of Theorem infeq1
StepHypRef Expression
1 supeq1 9450 . 2 (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅))
2 df-inf 9448 . 2 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
3 df-inf 9448 . 2 inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅)
41, 2, 33eqtr4g 2823 1 (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569  ◡ccnv 5654  supcsup 9445  infcinf 9446
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2101  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-sup 9447  df-inf 9448
This theorem is used by:  infeq1d  9483  infeq1i  9484  ramcl2lem  17202  odfval  19761  odval  19763  submod  19798  ioorval  25910  uniioombllem6  25924  infleinf  46525  infxrpnf  46598  prproropf1olem2  48728  prproropf1olem3  48729  prproropf1olem4  48730  prproropf1o  48731  prproropreud  48733
  Copyright terms: Public domain W3C validator