Theorem imbrov2fvoveq 6110

Description: Equality theorem for nested function and operation value in an implication for a binary relation. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 17-Aug-2022.)

Hypothesis

Ref	Expression
imbrov2fvoveq.1	⊢ (𝑋 = 𝑌 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
imbrov2fvoveq	⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)))

Proof of Theorem imbrov2fvoveq

Step	Hyp	Ref	Expression
1		imbrov2fvoveq.1	. 2 ⊢ (𝑋 = 𝑌 → (𝜑 ↔ 𝜓))
2		fveq2 5695	. . . 4 ⊢ (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌))
3	2	fvoveq1d 6107	. . 3 ⊢ (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂)))
4	3	breq1d 4140	. 2 ⊢ (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))
5	1, 4	imbi12d 234	1 ⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088

This theorem is used by:  cncfco  15692  mulcncflem  15708  ivthinclemlopn  15737  ivthinclemuopn  15739  limcimolemlt  15765  eflt  15876