| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1cdmsn | Structured version Visualization version GIF version | ||
| Description: If a one-to-one function with a nonempty domain has a singleton as its codomain, its domain must also be a singleton. (Contributed by BTernaryTau, 1-Dec-2024.) |
| Ref | Expression |
|---|---|
| f1cdmsn | ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑥 𝐴 = {𝑥}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1f 6778 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1→{𝐵} → 𝐹:𝐴⟶{𝐵}) | |
| 2 | fvconst 7166 | . . . . . . . . 9 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = 𝐵) | |
| 3 | 2 | 3adant3 1150 | . . . . . . . 8 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = 𝐵) |
| 4 | fvconst 7166 | . . . . . . . . 9 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵) | |
| 5 | 4 | 3adant2 1149 | . . . . . . . 8 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵) |
| 6 | 3, 5 | eqtr4d 2803 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑧)) |
| 7 | 1, 6 | syl3an1 1181 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑧)) |
| 8 | f1veqaeq 7259 | . . . . . . 7 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)) | |
| 9 | 8 | 3impb 1132 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)) |
| 10 | 7, 9 | mpd 16 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → 𝑦 = 𝑧) |
| 11 | 10 | 3expia 1139 | . . . 4 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ 𝐴 → 𝑦 = 𝑧)) |
| 12 | 11 | ralrimiv 3158 | . . 3 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝑦 ∈ 𝐴) → ∀𝑧 ∈ 𝐴 𝑦 = 𝑧) |
| 13 | 12 | reximdva0 4310 | . 2 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑦 = 𝑧) |
| 14 | issn 4799 | . 2 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑦 = 𝑧 → ∃𝑥 𝐴 = {𝑥}) | |
| 15 | 13, 14 | syl 18 | 1 ⊢ ((𝐹:𝐴–1-1→{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑥 𝐴 = {𝑥}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2146 ≠ wne 2960 ∀wral 3081 ∃wrex 3091 ∅c0 4286 {csn 4591 ⟶wf 6536 –1-1→wf1 6537 ‘cfv 6540 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fv 6548 |
| This theorem is used by: snnen2o 9212 sdom1 9217 1sdom2dom 9221 |
| Copyright terms: Public domain | W3C validator |