| 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 485 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐹:𝐴⟶𝐵) |
| 3 | fcores.e | . . . 4 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶) | |
| 4 | fcores.p | . . . 4 ⊢ 𝑃 = (◡𝐹 “ 𝐶) | |
| 5 | fcores.x | . . . 4 ⊢ 𝑋 = (𝐹 ↾ 𝑃) | |
| 6 | fcores.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷) | |
| 7 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐺:𝐶⟶𝐷) |
| 8 | fcores.y | . . . 4 ⊢ 𝑌 = (𝐺 ↾ 𝐸) | |
| 9 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) | |
| 10 | 2, 3, 4, 5, 7, 8, 9 | fcoresf1 47834 | . . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷)) |
| 11 | 10 | ex 417 | . 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
| 12 | f1co 6787 | . . . 4 ⊢ ((𝑌:𝐸–1-1→𝐷 ∧ 𝑋:𝑃–1-1→𝐸) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) | |
| 13 | 12 | ancoms 463 | . . 3 ⊢ ((𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) |
| 14 | 1, 3, 4, 5, 6, 8 | fcores 47832 | . . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋)) |
| 15 | f1eq1 6769 | . . . 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 400 = wceq 1570 ∩ cin 3904 ◡ccnv 5660 ran crn 5662 ↾ cres 5663 “ cima 5664 ∘ ccom 5665 ⟶wf 6532 –1-1→wf1 6533 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-fv 6544 |
| This theorem is used by: fcoresf1ob 47838 |
| Copyright terms: Public domain | W3C validator |