Theorem imbrov2fvoveq 7436

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 6882	. . . 4 ⊢ (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌))
3	2	fvoveq1d 7433	. . 3 ⊢ (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂)))
4	3	breq1d 5123	. 2 ⊢ (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))
5	1, 4	imbi12d 347	1 ⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1567   class class class wbr 5113  ‘cfv 6537  (class class class)co 7411

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-iota 6493  df-fv 6545  df-ov 7414

This theorem is referenced by:  rlim2  15547  rlimclim1  15596  rlimcn1  15639  climcn1  15643  caucvgrlem  15724  cncfco  25035  ftc1lem4  26167  ftc1lem6  26169  itg2gt0cn  38214  ftc1cnnclem  38230  ftc1cnnc  38231  idlimc  46234  limcperiod  46236  limclner  46257  cncfshift  46480  cncfperiod  46485  fperdvper  46525