![]() |
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 480 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐹:𝐴⟶𝐵) |
3 | fcores.e | . . . 4 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶) | |
4 | fcores.p | . . . 4 ⊢ 𝑃 = (◡𝐹 “ 𝐶) | |
5 | fcores.x | . . . 4 ⊢ 𝑋 = (𝐹 ↾ 𝑃) | |
6 | fcores.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷) | |
7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → 𝐺:𝐶⟶𝐷) |
8 | fcores.y | . . . 4 ⊢ 𝑌 = (𝐺 ↾ 𝐸) | |
9 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) | |
10 | 2, 3, 4, 5, 7, 8, 9 | fcoresf1 47019 | . . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–1-1→𝐷) → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷)) |
11 | 10 | ex 412 | . 2 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 → (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
12 | f1co 6816 | . . . 4 ⊢ ((𝑌:𝐸–1-1→𝐷 ∧ 𝑋:𝑃–1-1→𝐸) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) | |
13 | 12 | ancoms 458 | . . 3 ⊢ ((𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷) → (𝑌 ∘ 𝑋):𝑃–1-1→𝐷) |
14 | 1, 3, 4, 5, 6, 8 | fcores 47017 | . . . 4 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋)) |
15 | f1eq1 6800 | . . . 4 ⊢ ((𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋) → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–1-1→𝐷)) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–1-1→𝐷)) |
17 | 13, 16 | imbitrrid 246 | . 2 ⊢ (𝜑 → ((𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷) → (𝐺 ∘ 𝐹):𝑃–1-1→𝐷)) |
18 | 11, 17 | impbid 212 | 1 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–1-1→𝐷 ↔ (𝑋:𝑃–1-1→𝐸 ∧ 𝑌:𝐸–1-1→𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∩ cin 3962 ◡ccnv 5688 ran crn 5690 ↾ cres 5691 “ cima 5692 ∘ ccom 5693 ⟶wf 6559 –1-1→wf1 6560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-fv 6571 |
This theorem is referenced by: fcoresf1ob 47023 |
Copyright terms: Public domain | W3C validator |