| 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 6861 | . . . 4 ⊢ (𝑋 = 𝑌 → (𝐺‘𝑋) = (𝐺‘𝑌)) | |
| 3 | 2 | fvoveq1d 7412 | . . 3 ⊢ (𝑋 = 𝑌 → (𝐹‘((𝐺‘𝑋) · 𝑂)) = (𝐹‘((𝐺‘𝑌) · 𝑂))) |
| 4 | 3 | breq1d 5120 | . 2 ⊢ (𝑋 = 𝑌 → ((𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴 ↔ (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴)) |
| 5 | 1, 4 | imbi12d 344 | 1 ⊢ (𝑋 = 𝑌 → ((𝜑 → (𝐹‘((𝐺‘𝑋) · 𝑂))𝑅𝐴) ↔ (𝜓 → (𝐹‘((𝐺‘𝑌) · 𝑂))𝑅𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 class class class wbr 5110 ‘cfv 6514 (class class class)co 7390 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-iota 6467 df-fv 6522 df-ov 7393 |
| This theorem is referenced by: rlim2 15469 rlimclim1 15518 rlimcn1 15561 climcn1 15565 caucvgrlem 15646 cncfco 24807 ftc1lem4 25953 ftc1lem6 25955 itg2gt0cn 37676 ftc1cnnclem 37692 ftc1cnnc 37693 idlimc 45631 limcperiod 45633 limclner 45656 cncfshift 45879 cncfperiod 45884 fperdvper 45924 |
| Copyright terms: Public domain | W3C validator |