| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1f1 | Structured version Visualization version GIF version | ||
| Description: Conditions for a length 1 string to be a one-to-one function. (Contributed by Thierry Arnoux, 11-Dec-2023.) |
| Ref | Expression |
|---|---|
| s1f1.1 | ⊢ (𝜑 → 𝐼 ∈ 𝐷) |
| Ref | Expression |
|---|---|
| s1f1 | ⊢ (𝜑 → 〈“𝐼”〉:dom 〈“𝐼”〉–1-1→𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0nn0 12624 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 2 | 1 | a1i 11 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℕ0) |
| 3 | s1f1.1 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝐷) | |
| 4 | f1osng 6867 | . . . . 5 ⊢ ((0 ∈ ℕ0 ∧ 𝐼 ∈ 𝐷) → {〈0, 𝐼〉}:{0}–1-1-onto→{𝐼}) | |
| 5 | 2, 3, 4 | syl2anc 596 | . . . 4 ⊢ (𝜑 → {〈0, 𝐼〉}:{0}–1-1-onto→{𝐼}) |
| 6 | f1of1 6823 | . . . 4 ⊢ ({〈0, 𝐼〉}:{0}–1-1-onto→{𝐼} → {〈0, 𝐼〉}:{0}–1-1→{𝐼}) | |
| 7 | 5, 6 | syl 18 | . . 3 ⊢ (𝜑 → {〈0, 𝐼〉}:{0}–1-1→{𝐼}) |
| 8 | 3 | snssd 4743 | . . 3 ⊢ (𝜑 → {𝐼} ⊆ 𝐷) |
| 9 | f1ss 6785 | . . 3 ⊢ (({〈0, 𝐼〉}:{0}–1-1→{𝐼} ∧ {𝐼} ⊆ 𝐷) → {〈0, 𝐼〉}:{0}–1-1→𝐷) | |
| 10 | 7, 8, 9 | syl2anc 596 | . 2 ⊢ (𝜑 → {〈0, 𝐼〉}:{0}–1-1→𝐷) |
| 11 | s1val 14748 | . . . 4 ⊢ (𝐼 ∈ 𝐷 → 〈“𝐼”〉 = {〈0, 𝐼〉}) | |
| 12 | 3, 11 | syl 18 | . . 3 ⊢ (𝜑 → 〈“𝐼”〉 = {〈0, 𝐼〉}) |
| 13 | s1dm 14758 | . . . 4 ⊢ dom 〈“𝐼”〉 = {0} | |
| 14 | 13 | a1i 11 | . . 3 ⊢ (𝜑 → dom 〈“𝐼”〉 = {0}) |
| 15 | eqidd 2761 | . . 3 ⊢ (𝜑 → 𝐷 = 𝐷) | |
| 16 | 12, 14, 15 | f1eq123d 6816 | . 2 ⊢ (𝜑 → (〈“𝐼”〉:dom 〈“𝐼”〉–1-1→𝐷 ↔ {〈0, 𝐼〉}:{0}–1-1→𝐷)) |
| 17 | 10, 16 | mpbird 260 | 1 ⊢ (𝜑 → 〈“𝐼”〉:dom 〈“𝐼”〉–1-1→𝐷) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 {csn 4584 〈cop 4834 dom cdm 5650 –1-1→wf1 6535 –1-1-onto→wf1o 6537 0cc0 11203 ℕ0cn0 12609 〈“cs1 14745 |
| 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-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-fzo 13792 df-hash 14478 df-word 14662 df-s1 14746 |
| This theorem is used by: cycpmco2f1 33731 |
| Copyright terms: Public domain | W3C validator |