| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > imbrov2fvoveq | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| imbrov2fvoveq.1 | ⊢ (𝑋 = 𝑌 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| imbrov2fvoveq | ⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imbrov2fvoveq.1 | . 2 ⊢ (𝑋 = 𝑌 → (𝜑 ↔ 𝜓)) | |
| 2 | fveq2 6835 | . . . 4 ⊢ (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌)) | |
| 3 | 2 | fvoveq1d 7383 | . . 3 ⊢ (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂))) |
| 4 | 3 | breq1d 5096 | . 2 ⊢ (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)) |
| 5 | 1, 4 | imbi12d 344 | 1 ⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 class class class wbr 5086 ‘cfv 6493 (class class class)co 7361 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-iota 6449 df-fv 6501 df-ov 7364 |
| This theorem is referenced by: rlim2 15452 rlimclim1 15501 rlimcn1 15544 climcn1 15548 caucvgrlem 15629 cncfco 24887 ftc1lem4 26019 ftc1lem6 26021 itg2gt0cn 38013 ftc1cnnclem 38029 ftc1cnnc 38030 idlimc 46077 limcperiod 46079 limclner 46100 cncfshift 46323 cncfperiod 46328 fperdvper 46368 |
| Copyright terms: Public domain | W3C validator |