| 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 6840 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥))) | |
| 2 | fveq2 6840 | . . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥))) | |
| 3 | 1, 2 | breq12d 5098 | . . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦) ↔ (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 4 | ofrco.6 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺) | |
| 5 | ofrco.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 6 | ofrco.2 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴) | |
| 7 | ofrco.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | inidm 4167 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 9 | eqidd 2737 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦)) | |
| 10 | eqidd 2737 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦)) | |
| 11 | 5, 6, 7, 7, 8, 9, 10 | ofrfval 7641 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))) |
| 12 | 4, 11 | mpbid 232 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 13 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)) |
| 14 | ofrco.3 | . . . . 5 ⊢ (𝜑 → 𝐻:𝐶⟶𝐴) | |
| 15 | 14 | ffvelcdmda 7036 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ 𝐴) |
| 16 | 3, 13, 15 | rspcdva 3565 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 17 | 16 | ralrimiva 3129 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))) |
| 18 | fnfco 6705 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐹 ∘ 𝐻) Fn 𝐶) | |
| 19 | 5, 14, 18 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐻) Fn 𝐶) |
| 20 | fnfco 6705 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐺 ∘ 𝐻) Fn 𝐶) | |
| 21 | 6, 14, 20 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐻) Fn 𝐶) |
| 22 | ofrco.5 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 23 | inidm 4167 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 24 | 14 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻:𝐶⟶𝐴) |
| 25 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
| 26 | 24, 25 | fvco3d 6940 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥))) |
| 27 | 24, 25 | fvco3d 6940 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥))) |
| 28 | 19, 21, 22, 22, 23, 26, 27 | ofrfval 7641 | . 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻) ↔ ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))) |
| 29 | 17, 28 | mpbird 257 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 class class class wbr 5085 ∘ ccom 5635 Fn wfn 6493 ⟶wf 6494 ‘cfv 6498 ∘r cofr 7630 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pr 5375 |
| 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-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ofr 7632 |
| This theorem is referenced by: mplvrpmrhm 33691 |
| Copyright terms: Public domain | W3C validator |