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

Theorem infeq1 9506
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 9474 . 2 (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅))
2 df-inf 9472 . 2 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
3 df-inf 9472 . 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 1570  ◡ccnv 5657  supcsup 9469  infcinf 9470
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 4873  df-sup 9471  df-inf 9472
This theorem is used by:  infeq1d  9507  infeq1i  9508  ramcl2lem  17231  odfval  19797  odval  19799  submod  19834  ioorval  25950  uniioombllem6  25964  infleinf  46717  infxrpnf  46790  prproropf1olem2  48920  prproropf1olem3  48921  prproropf1olem4  48922  prproropf1o  48923  prproropreud  48925
  Copyright terms: Public domain W3C validator