Theorem infeq123d 9240

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

Step	Hyp	Ref	Expression
1		infeq123d.a	. . 3 ⊢ (𝜑 → 𝐴 = 𝐷)
2		infeq123d.b	. . 3 ⊢ (𝜑 → 𝐵 = 𝐸)
3		infeq123d.c	. . . 4 ⊢ (𝜑 → 𝐶 = 𝐹)
4	3	cnveqd 5784	. . 3 ⊢ (𝜑 → ◡𝐶 = ◡𝐹)
5	1, 2, 4	supeq123d 9209	. 2 ⊢ (𝜑 → sup(𝐴, 𝐵, ◡𝐶) = sup(𝐷, 𝐸, ◡𝐹))
6		df-inf 9202	. 2 ⊢ inf(𝐴, 𝐵, 𝐶) = sup(𝐴, 𝐵, ◡𝐶)
7		df-inf 9202	. 2 ⊢ inf(𝐷, 𝐸, 𝐹) = sup(𝐷, 𝐸, ◡𝐹)
8	5, 6, 7	3eqtr4g 2803	1 ⊢ (𝜑 → inf(𝐴, 𝐵, 𝐶) = inf(𝐷, 𝐸, 𝐹))

Syntax hints:   → wi 4   = wceq 1539  ^◡ccnv 5588  supcsup 9199  infcinf 9200

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-in 3894  df-ss 3904  df-uni 4840  df-br 5075  df-opab 5137  df-cnv 5597  df-sup 9201  df-inf 9202

This theorem is referenced by:  wsuceq123  33808  wlimeq12  33813