| 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 6842 | . . . 4 ⊢ (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌)) | |
| 3 | 2 | fvoveq1d 7390 | . . 3 ⊢ (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂))) |
| 4 | 3 | breq1d 5110 | . 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 5100 ‘cfv 6500 (class class class)co 7368 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-ov 7371 |
| This theorem is referenced by: rlim2 15431 rlimclim1 15480 rlimcn1 15523 climcn1 15527 caucvgrlem 15608 cncfco 24868 ftc1lem4 26014 ftc1lem6 26016 itg2gt0cn 37926 ftc1cnnclem 37942 ftc1cnnc 37943 idlimc 45986 limcperiod 45988 limclner 46009 cncfshift 46232 cncfperiod 46237 fperdvper 46277 |
| Copyright terms: Public domain | W3C validator |