Theorem infeq1 8942

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 8911	. 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, ◡𝑅) = sup(𝐶, 𝐴, ◡𝑅))
2		df-inf 8909	. 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
3		df-inf 8909	. 2 ⊢ inf(𝐶, 𝐴, 𝑅) = sup(𝐶, 𝐴, ◡𝑅)
4	1, 2, 3	3eqtr4g 2883	1 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅))

Syntax hints:   → wi 4   = wceq 1537  ^◡ccnv 5556  supcsup 8906  infcinf 8907

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-in 3945  df-ss 3954  df-uni 4841  df-sup 8908  df-inf 8909

This theorem is referenced by:  infeq1d  8943  infeq1i  8944  ramcl2lem  16347  odfval  18662  odval  18664  submod  18696  ioorval  24177  uniioombllem6  24191  infleinf  41647  infxrpnf  41728  prproropf1olem2  43673  prproropf1olem3  43674  prproropf1olem4  43675  prproropf1o  43676  prproropreud  43678