| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fcoresf1b | Structured version Visualization version GIF version | ||
| Description: A composition is injective iff the restrictions of its components to the minimum domains are injective. (Contributed by GL and AV, 7-Oct-2024.) |
| Ref | Expression |
|---|---|
| fcores.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| fcores.e | ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶) |
| fcores.p | ⊢ 𝑃 = (◡𝐹 “ 𝐶) |
| fcores.x | ⊢ 𝑋 = (𝐹 ↾ 𝑃) |
| fcores.g | ⊢ (𝜑 → 𝐺:𝐶⟶𝐷) |
| fcores.y | ⊢ 𝑌 = (𝐺 ↾ 𝐸) |
| Ref | Expression |
|---|---|
| fcoresf1b | ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fcores.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐹:𝐴⟶𝐵) |
| 3 | fcores.e | . . . 4 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶) | |
| 4 | fcores.p | . . . 4 ⊢ 𝑃 = (◡𝐹 “ 𝐶) | |
| 5 | fcores.x | . . . 4 ⊢ 𝑋 = (𝐹 ↾ 𝑃) | |
| 6 | fcores.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷) | |
| 7 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐺:𝐶⟶𝐷) |
| 8 | fcores.y | . . . 4 ⊢ 𝑌 = (𝐺 ↾ 𝐸) | |
| 9 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) | |
| 10 | 2, 3, 4, 5, 7, 8, 9 | fcoresf1 48232 | . . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷)) |
| 11 | 10 | ex 418 | . 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
| 12 | f1co 6791 | . . . 4 ⊢ ((𝑌:𝐸–1-1→𝐷 ∧ 𝑋:𝑃–1-1→𝐸) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) | |
| 13 | 12 | ancoms 464 | . . 3 ⊢ ((𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) |
| 14 | 1, 3, 4, 5, 6, 8 | fcores 48230 | . . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋)) |
| 15 | f1eq1 6773 | . . . 4 ⊢ ((𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋) → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–1-1→𝐷)) | |
| 16 | 14, 15 | syl 18 | . . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–1-1→𝐷)) |
| 17 | 13, 16 | imbitrrid 249 | . 2 ⊢ (𝜑 → ((𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷) → (𝐺 ∘ 𝐹):𝑃–1-1→𝐷)) |
| 18 | 11, 17 | impbid 215 | 1 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∩ cin 4089 ◡ccnv 5649 ran crn 5651 ↾ cres 5652 “ cima 5653 ∘ ccom 5654 ⟶wf 6534 –1-1→wf1 6535 |
| 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-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-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 4585 df-pr 4587 df-op 4835 df-uni 4867 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-fv 6546 |
| This theorem is used by: fcoresf1ob 48236 |
| Copyright terms: Public domain | W3C validator |