Theorem infeq123d 9474

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 5852	. . 3 ⊢ (𝜑 → ◡𝐶 = ◡𝐹)
5	1, 2, 4	supeq123d 9442	. 2 ⊢ (𝜑 → sup(𝐴, 𝐵, ◡𝐶) = sup(𝐷, 𝐸, ◡𝐹))
6		df-inf 9435	. 2 ⊢ inf(𝐴, 𝐵, 𝐶) = sup(𝐴, 𝐵, ◡𝐶)
7		df-inf 9435	. 2 ⊢ inf(𝐷, 𝐸, 𝐹) = sup(𝐷, 𝐸, ◡𝐹)
8	5, 6, 7	3eqtr4g 2820	1 ⊢ (𝜑 → inf(𝐴, 𝐵, 𝐶) = inf(𝐷, 𝐸, 𝐹))

This proof depends on syntax axioms:   → wi 4   = wceq 1569  ^◡ccnv 5649  supcsup 9432  infcinf 9433

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-uni 4867  df-br 5103  df-opab 5167  df-cnv 5658  df-sup 9434  df-inf 9435

This theorem is used by:  wsuceq123  36576  wlimeq12  36581