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

Theorem imbrov2fvoveq 7181
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 6670 . . . 4 (𝑋 = 𝑌 → (𝐺𝑋) = (𝐺𝑌))
32fvoveq1d 7178 . . 3 (𝑋 = 𝑌 → (𝐹‘((𝐺𝑋) · 𝑂)) = (𝐹‘((𝐺𝑌) · 𝑂)))
43breq1d 5076 . 2 (𝑋 = 𝑌 → ((𝐹‘((𝐺𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺𝑌) · 𝑂))𝑅𝐴))
51, 4imbi12d 347 1 (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺𝑌) · 𝑂))𝑅𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1537   class class class wbr 5066  cfv 6355  (class class class)co 7156
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 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-iota 6314  df-fv 6363  df-ov 7159
This theorem is referenced by:  rlim2  14853  rlimclim1  14902  rlimcn1  14945  climcn1  14948  caucvgrlem  15029  cncfco  23515  ftc1lem4  24636  ftc1lem6  24638  itg2gt0cn  34962  ftc1cnnclem  34980  ftc1cnnc  34981  idlimc  41956  limcperiod  41958  limclner  41981  cncfshift  42206  cncfperiod  42211  fperdvper  42252
  Copyright terms: Public domain W3C validator