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

Theorem infeq123d 8270
 Description: Equality deduction for infimum. (Contributed by AV, 2-Sep-2020.)
Hypotheses
Ref Expression
infeq123d.a (𝜑𝐴 = 𝐷)
infeq123d.b (𝜑𝐵 = 𝐸)
infeq123d.c (𝜑𝐶 = 𝐹)
Assertion
Ref Expression
infeq123d (𝜑 → inf(𝐴, 𝐵, 𝐶) = inf(𝐷, 𝐸, 𝐹))

Proof of Theorem infeq123d
StepHypRef Expression
1 infeq123d.a . . 3 (𝜑𝐴 = 𝐷)
2 infeq123d.b . . 3 (𝜑𝐵 = 𝐸)
3 infeq123d.c . . . 4 (𝜑𝐶 = 𝐹)
43cnveqd 5220 . . 3 (𝜑𝐶 = 𝐹)
51, 2, 4supeq123d 8239 . 2 (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))
6 df-inf 8232 . 2 inf(𝐴, 𝐵, 𝐶) = sup(𝐴, 𝐵, 𝐶)
7 df-inf 8232 . 2 inf(𝐷, 𝐸, 𝐹) = sup(𝐷, 𝐸, 𝐹)
85, 6, 73eqtr4g 2669 1 (𝜑 → inf(𝐴, 𝐵, 𝐶) = inf(𝐷, 𝐸, 𝐹))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1475  ◡ccnv 5037  supcsup 8229  infcinf 8230 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-in 3547  df-ss 3554  df-uni 4373  df-br 4584  df-opab 4644  df-cnv 5046  df-sup 8231  df-inf 8232 This theorem is referenced by:  wsuceq123  31004  wlimeq12  31009
 Copyright terms: Public domain W3C validator