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

Theorem infeq1 9469
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 9437 . 2 (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅))
2 df-inf 9435 . 2 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
3 df-inf 9435 . 2 inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅)
41, 2, 33eqtr4g 2821 1 (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  ◡ccnv 5650  supcsup 9432  infcinf 9433
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-ss 3916  df-uni 4868  df-sup 9434  df-inf 9435
This theorem is used by:  infeq1d  9470  infeq1i  9471  ramcl2lem  17187  odfval  19746  odval  19748  submod  19783  ioorval  25895  uniioombllem6  25909  infleinf  46382  infxrpnf  46455  prproropf1olem2  48585  prproropf1olem3  48586  prproropf1olem4  48587  prproropf1o  48588  prproropreud  48590
  Copyright terms: Public domain W3C validator