Theorem infeq1 8651

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

Assertion

Ref	Expression
infeq1	⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅))

Proof of Theorem infeq1

Step	Hyp	Ref	Expression
1		supeq1 8620	. 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅))
2		df-inf 8618	. 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
3		df-inf 8618	. 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅)
4	1, 2, 3	3eqtr4g 2886	1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅))

Syntax hints:   → wi 4   = wceq 1656  ^◡ccnv 5341  supcsup 8615  infcinf 8616

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-ext 2803

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-uni 4659  df-sup 8617  df-inf 8618

This theorem is referenced by:  infeq1d  8652  infeq1i  8653  ramcl2lem  16084  odval  18304  submod  18335  ioorval  23740  uniioombllem6  23754  infleinf  40378  infxrpnf  40462