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

Theorem imbrov2fvoveq 7445
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 6885 . . . 4 (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌))
32fvoveq1d 7442 . . 3 (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂)))
43breq1d 5113 . 2 (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))
51, 4imbi12d 347 1 (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6494  df-fv 6546  df-ov 7423
This theorem is used by:  rlim2  15663  rlimclim1  15712  rlimcn1  15755  climcn1  15759  caucvgrlem  15840  cncfco  25228  ftc1lem4  26359  ftc1lem6  26361  itg2gt0cn  38593  ftc1cnnclem  38609  ftc1cnnc  38610  idlimc  46637  limcperiod  46639  limclner  46660  cncfshift  46883  cncfperiod  46888  fperdvper  46928
  Copyright terms: Public domain W3C validator