| 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 6800 | . . . . . 6 ⊢ (𝐺:𝐶–1-1-onto→𝐷 → 𝐺:𝐶–1-1→𝐷) | |
| 2 | 1 | anim1i 624 | . . . . 5 ⊢ ((𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶)) |
| 3 | 2 | 3adant1 1142 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶)) |
| 4 | f1ores 6816 | . . . 4 ⊢ ((𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵)) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵)) |
| 6 | simp1 1148 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → 𝐹:𝐴–1-1-onto→𝐵) | |
| 7 | f1oco 6825 | . . 3 ⊢ (((𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵) ∧ 𝐹:𝐴–1-1-onto→𝐵) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) | |
| 8 | 5, 6, 7 | syl2anc 593 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) |
| 9 | f1ofo 6809 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵) | |
| 10 | forn 6776 | . . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵) | |
| 11 | 9, 10 | syl 17 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 = 𝐵) |
| 12 | 11 | eqimssd 3990 | . . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 ⊆ 𝐵) |
| 13 | 12 | 3ad2ant1 1145 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ran 𝐹 ⊆ 𝐵) |
| 14 | cores 6231 | . . . . 5 ⊢ (ran 𝐹 ⊆ 𝐵 → ((𝐺 ↾ 𝐵) ∘ 𝐹) = (𝐺 ∘ 𝐹)) | |
| 15 | 14 | eqcomd 2767 | . . . 4 ⊢ (ran 𝐹 ⊆ 𝐵 → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹)) |
| 16 | 13, 15 | syl 17 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹)) |
| 17 | 16 | f1oeq1d 6796 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵) ↔ ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))) |
| 18 | 8, 17 | mpbird 259 | 1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ⊆ wss 3902 ran crn 5644 ↾ cres 5645 “ cima 5646 ∘ ccom 5647 –1-1→wf1 6513 –onto→wfo 6514 –1-1-onto→wf1o 6515 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 |
| This theorem is referenced by: 3f1oss1 47630 |
| Copyright terms: Public domain | W3C validator |