| 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 6831 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥))) | |
| 2 | fveq2 6831 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥))) | |
| 3 | 1, 2 | breq12d 5088 | . . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦) ↔ (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 4 | ofrco.6 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺) | |
| 5 | ofrco.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 6 | ofrco.2 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴) | |
| 7 | ofrco.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | inidm 4158 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 9 | eqidd 2742 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦)) | |
| 10 | eqidd 2742 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦)) | |
| 11 | 5, 6, 7, 7, 8, 9, 10 | ofrfval 7634 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))) |
| 12 | 4, 11 | mpbid 234 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 13 | 12 | adantr 482 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 14 | ofrco.3 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐶⟶𝐴) | |
| 15 | 14 | ffvelcdmda 7029 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ 𝐴) |
| 16 | 3, 13, 15 | rspcdva 3563 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 17 | 16 | ralrimiva 3133 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 18 | fnfco 6696 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐹 ∘ 𝐻) Fn 𝐶) | |
| 19 | 5, 14, 18 | syl2anc 591 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐻) Fn 𝐶) |
| 20 | fnfco 6696 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐺 ∘ 𝐻) Fn 𝐶) | |
| 21 | 6, 14, 20 | syl2anc 591 | . . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐻) Fn 𝐶) |
| 22 | ofrco.5 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 23 | inidm 4158 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 24 | 14 | adantr 482 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻:𝐶⟶𝐴) |
| 25 | simpr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
| 26 | 24, 25 | fvco3d 6932 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥))) |
| 27 | 24, 25 | fvco3d 6932 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥))) |
| 28 | 19, 21, 22, 22, 23, 26, 27 | ofrfval 7634 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻) ↔ ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 29 | 17, 28 | mpbird 259 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∀wral 3055 class class class wbr 5075 ∘ ccom 5625 Fn wfn 6484 ⟶wf 6485 ‘cfv 6489 ∘r cofr 7623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ofr 7625 |
| This theorem is referenced by: mplvrpmrhm 33743 |
| Copyright terms: Public domain | W3C validator |