| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 3f1oss2 | Structured version Visualization version GIF version | ||
| Description: The composition of three bijections as bijection from the image of the converse of the domain onto the image of the converse of the range of the middle bijection. (Contributed by AV, 15-Aug-2025.) |
| Ref | Expression |
|---|---|
| 3f1oss2 | ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐻:𝐸–1-1-onto→𝐼) ∧ (𝐶 ⊆ 𝐵 ∧ 𝐷 ⊆ 𝐼)) → ((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1ocnv 6830 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 2 | id 23 | . . 3 ⊢ (𝐺:𝐶–1-1-onto→𝐷 → 𝐺:𝐶–1-1-onto→𝐷) | |
| 3 | f1ocnv 6830 | . . 3 ⊢ (𝐻:𝐸–1-1-onto→𝐼 → ◡𝐻:𝐼–1-1-onto→𝐸) | |
| 4 | 3f1oss1 47963 | . . 3 ⊢ (((◡𝐹:𝐵–1-1-onto→𝐴 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ ◡𝐻:𝐼–1-1-onto→𝐸) ∧ (𝐶 ⊆ 𝐵 ∧ 𝐷 ⊆ 𝐼)) → ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷)) | |
| 5 | 1, 2, 3, 4 | syl3anl 1442 | . 2 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐻:𝐸–1-1-onto→𝐼) ∧ (𝐶 ⊆ 𝐵 ∧ 𝐷 ⊆ 𝐼)) → ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷)) |
| 6 | f1orel 6820 | . . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → Rel 𝐹) | |
| 7 | dfrel2 6182 | . . . . . . . . 9 ⊢ (Rel 𝐹 ↔ ◡◡𝐹 = 𝐹) | |
| 8 | 7 | biimpi 219 | . . . . . . . 8 ⊢ (Rel 𝐹 → ◡◡𝐹 = 𝐹) |
| 9 | 8 | eqcomd 2766 | . . . . . . 7 ⊢ (Rel 𝐹 → 𝐹 = ◡◡𝐹) |
| 10 | 9 | coeq2d 5842 | . . . . . 6 ⊢ (Rel 𝐹 → ((◡𝐻 ∘ 𝐺) ∘ 𝐹) = ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹)) |
| 11 | 10 | f1oeq1d 6812 | . . . . 5 ⊢ (Rel 𝐹 → (((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷) ↔ ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷))) |
| 12 | 6, 11 | syl 18 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷) ↔ ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷))) |
| 13 | 12 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐻:𝐸–1-1-onto→𝐼) → (((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷) ↔ ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷))) |
| 14 | 13 | adantr 486 | . 2 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐻:𝐸–1-1-onto→𝐼) ∧ (𝐶 ⊆ 𝐵 ∧ 𝐷 ⊆ 𝐼)) → (((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷) ↔ ((◡𝐻 ∘ 𝐺) ∘ ◡◡𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷))) |
| 15 | 5, 14 | mpbird 260 | 1 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐻:𝐸–1-1-onto→𝐼) ∧ (𝐶 ⊆ 𝐵 ∧ 𝐷 ⊆ 𝐼)) → ((◡𝐻 ∘ 𝐺) ∘ 𝐹):(◡𝐹 “ 𝐶)–1-1-onto→(◡𝐻 “ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ⊆ wss 3899 ◡ccnv 5654 “ cima 5658 ∘ ccom 5659 Rel wrel 5660 –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-nul 5263 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-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 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-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 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-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 |
| This theorem is used by: uspgrlim 48908 |
| Copyright terms: Public domain | W3C validator |