| 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 5115 | . . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦) ↔ (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 4 | ofrco.6 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺) | |
| 5 | ofrco.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 6 | ofrco.2 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴) | |
| 7 | ofrco.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | inidm 4123 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 9 | eqidd 2761 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦)) | |
| 10 | eqidd 2761 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦)) | |
| 11 | 5, 6, 7, 7, 8, 9, 10 | ofrfval 7703 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))) |
| 12 | 4, 11 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 13 | 12 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 14 | ofrco.3 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐶⟶𝐴) | |
| 15 | 14 | ffvelcdmda 7084 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ 𝐴) |
| 16 | 3, 13, 15 | rspcdva 3577 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 17 | 16 | ralrimiva 3154 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 18 | fnfco 6747 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐹 ∘ 𝐻) Fn 𝐶) | |
| 19 | 5, 14, 18 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐻) Fn 𝐶) |
| 20 | fnfco 6747 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐺 ∘ 𝐻) Fn 𝐶) | |
| 21 | 6, 14, 20 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐻) Fn 𝐶) |
| 22 | ofrco.5 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 23 | inidm 4123 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 24 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻:𝐶⟶𝐴) |
| 25 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
| 26 | 24, 25 | fvco3d 6986 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥))) |
| 27 | 24, 25 | fvco3d 6986 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥))) |
| 28 | 19, 21, 22, 22, 23, 26, 27 | ofrfval 7703 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻) ↔ ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 29 | 17, 28 | mpbird 260 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 class class class wbr 5102 ∘ ccom 5654 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 ∘r cofr 7692 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ofr 7694 |
| This theorem is used by: mplvrpmrhm 34179 |
| Copyright terms: Public domain | W3C validator |