Theorem infeq123d 7144

Description: Equality deduction for infimum. (Contributed by AV, 2-Sep-2020.)

Hypotheses

Ref	Expression
infeq123d.a	|- ( ph -> A = D )
infeq123d.b	|- ( ph -> B = E )
infeq123d.c	|- ( ph -> C = F )

Assertion

Ref	Expression
infeq123d	|- ( ph -> inf ( A , B , C ) = inf ( D , E , F ) )

Proof of Theorem infeq123d

Step	Hyp	Ref	Expression
1		infeq123d.a	. . 3 |- ( ph -> A = D )
2		infeq123d.b	. . 3 |- ( ph -> B = E )
3		infeq123d.c	. . . 4 |- ( ph -> C = F )
4	3	cnveqd 4872	. . 3 |- ( ph -> `' C = `' F )
5	1, 2, 4	supeq123d 7119	. 2 |- ( ph -> sup ( A , B , `' C ) = sup ( D , E , `' F ) )
6		df-inf 7113	. 2 |- inf ( A , B , C ) = sup ( A , B , `' C )
7		df-inf 7113	. 2 |- inf ( D , E , F ) = sup ( D , E , `' F )
8	5, 6, 7	3eqtr4g 2265	1 |- ( ph -> inf ( A , B , C ) = inf ( D , E , F ) )

Syntax hints:   -> wi 4   = wceq 1373   `'ccnv 4692   supcsup 7110  infcinf 7111

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-in 3180  df-ss 3187  df-uni 3865  df-br 4060  df-opab 4122  df-cnv 4701  df-sup 7112  df-inf 7113

This theorem is referenced by: (None)