| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1ocoima | Structured version Visualization version GIF version | ||
| Description: The composition of two bijections as bijection onto the image of the range of the first bijection. (Contributed by AV, 15-Aug-2025.) |
| Ref | Expression |
|---|---|
| f1ocoima | ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1of1 6816 | . . . . . 6 ⊢ (𝐺:𝐶–1-1-onto→𝐷 → 𝐺:𝐶–1-1→𝐷) | |
| 2 | 1 | anim1i 627 | . . . . 5 ⊢ ((𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶)) |
| 3 | 2 | 3adant1 1148 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶)) |
| 4 | f1ores 6832 | . . . 4 ⊢ ((𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵)) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵)) |
| 6 | simp1 1154 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → 𝐹:𝐴–1-1-onto→𝐵) | |
| 7 | f1oco 6841 | . . 3 ⊢ (((𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵) ∧ 𝐹:𝐴–1-1-onto→𝐵) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) | |
| 8 | 5, 6, 7 | syl2anc 596 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) |
| 9 | f1ofo 6825 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵) | |
| 10 | forn 6792 | . . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵) | |
| 11 | 9, 10 | syl 18 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 = 𝐵) |
| 12 | 11 | eqimssd 3987 | . . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 ⊆ 𝐵) |
| 13 | 12 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ran 𝐹 ⊆ 𝐵) |
| 14 | cores 6245 | . . . . 5 ⊢ (ran 𝐹 ⊆ 𝐵 → ((𝐺 ↾ 𝐵) ∘ 𝐹) = (𝐺 ∘ 𝐹)) | |
| 15 | 14 | eqcomd 2766 | . . . 4 ⊢ (ran 𝐹 ⊆ 𝐵 → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹)) |
| 16 | 13, 15 | syl 18 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹)) |
| 17 | 16 | f1oeq1d 6812 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵) ↔ ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))) |
| 18 | 8, 17 | mpbird 260 | 1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ⊆ wss 3899 ran crn 5656 ↾ cres 5657 “ cima 5658 ∘ ccom 5659 –1-1→wf1 6530 –onto→wfo 6531 –1-1-onto→wf1o 6532 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 |
| This theorem is used by: 3f1oss1 47963 |
| Copyright terms: Public domain | W3C validator |