Theorem infeq123d 6981

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

Syntax hints:   → wi 4   = wceq 1343  ^◡ccnv 4603  supcsup 6947  infcinf 6948

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-in 3122  df-ss 3129  df-uni 3790  df-br 3983  df-opab 4044  df-cnv 4612  df-sup 6949  df-inf 6950

This theorem is referenced by: (None)