| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ofrco | Structured version Visualization version GIF version | ||
| Description: Function relation between function compositions. (Contributed by Thierry Arnoux, 15-Jan-2026.) |
| Ref | Expression |
|---|---|
| ofrco.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| ofrco.2 | ⊢ (𝜑 → 𝐺 Fn 𝐴) |
| ofrco.3 | ⊢ (𝜑 → 𝐻:𝐶⟶𝐴) |
| ofrco.4 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ofrco.5 | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
| ofrco.6 | ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺) |
| Ref | Expression |
|---|---|
| ofrco | ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6885 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥))) | |
| 2 | fveq2 6885 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥))) | |
| 3 | 1, 2 | breq12d 5127 | . . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦) ↔ (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 4 | ofrco.6 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺) | |
| 5 | ofrco.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 6 | ofrco.2 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴) | |
| 7 | ofrco.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | inidm 4187 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 9 | eqidd 2771 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦)) | |
| 10 | eqidd 2771 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦)) | |
| 11 | 5, 6, 7, 7, 8, 9, 10 | ofrfval 7688 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))) |
| 12 | 4, 11 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 13 | 12 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 14 | ofrco.3 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐶⟶𝐴) | |
| 15 | 14 | ffvelcdmda 7083 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ 𝐴) |
| 16 | 3, 13, 15 | rspcdva 3590 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 17 | 16 | ralrimiva 3164 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 18 | fnfco 6747 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐹 ∘ 𝐻) Fn 𝐶) | |
| 19 | 5, 14, 18 | syl2anc 595 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐻) Fn 𝐶) |
| 20 | fnfco 6747 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐺 ∘ 𝐻) Fn 𝐶) | |
| 21 | 6, 14, 20 | syl2anc 595 | . . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐻) Fn 𝐶) |
| 22 | ofrco.5 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 23 | inidm 4187 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 24 | 14 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻:𝐶⟶𝐴) |
| 25 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
| 26 | 24, 25 | fvco3d 6986 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥))) |
| 27 | 24, 25 | fvco3d 6986 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥))) |
| 28 | 19, 21, 22, 22, 23, 26, 27 | ofrfval 7688 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻) ↔ ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 29 | 17, 28 | mpbird 260 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1568 ∈ wcel 2150 ∀wral 3086 class class class wbr 5114 ∘ ccom 5669 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 ∘r cofr 7677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pr 5408 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5560 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ofr 7679 |
| This theorem is referenced by: mplvrpmrhm 33907 |
| Copyright terms: Public domain | W3C validator |