MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  imbrov2fvoveq Structured version   Visualization version   GIF version

Theorem imbrov2fvoveq 7452
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
StepHypRef Expression
1 imbrov2fvoveq.1 . 2 (𝑋 = 𝑌 → (𝜑 ↔ 𝜓))
2 fveq2 6893 . . . 4 (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌))
32fvoveq1d 7449 . . 3 (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂)))
43breq1d 5115 . 2 (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))
51, 4imbi12d 347 1 (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   class class class wbr 5105  ‘cfv 6546  (class class class)co 7427
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-iota 6500  df-fv 6554  df-ov 7430
This theorem is used by:  rlim2  15675  rlimclim1  15724  rlimcn1  15767  climcn1  15771  caucvgrlem  15852  cncfco  25240  ftc1lem4  26371  ftc1lem6  26373  itg2gt0cn  38733  ftc1cnnclem  38749  ftc1cnnc  38750  idlimc  46777  limcperiod  46779  limclner  46800  cncfshift  47023  cncfperiod  47028  fperdvper  47068
  Copyright terms: Public domain W3C validator