| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > znfi | GIF version | ||
| Description: The ℤ/nℤ structure is a finite ring. (Contributed by Mario Carneiro, 2-May-2016.) |
| Ref | Expression |
|---|---|
| zntos.y | ⊢ 𝑌 = (ℤ/nℤ‘𝑁) |
| znhash.1 | ⊢ 𝐵 = (Base‘𝑌) |
| Ref | Expression |
|---|---|
| znfi | ⊢ (𝑁 ∈ ℕ → 𝐵 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0z 9495 | . . 3 ⊢ 0 ∈ ℤ | |
| 2 | nnz 9503 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 3 | fzofig 10700 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 4 | 1, 2, 3 | sylancr 414 | . 2 ⊢ (𝑁 ∈ ℕ → (0..^𝑁) ∈ Fin) |
| 5 | nnnn0 9414 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 6 | zntos.y | . . . . . . 7 ⊢ 𝑌 = (ℤ/nℤ‘𝑁) | |
| 7 | znhash.1 | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑌) | |
| 8 | eqid 2230 | . . . . . . 7 ⊢ ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) = ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) | |
| 9 | eqid 2230 | . . . . . . 7 ⊢ if(𝑁 = 0, ℤ, (0..^𝑁)) = if(𝑁 = 0, ℤ, (0..^𝑁)) | |
| 10 | 6, 7, 8, 9 | znf1o 14689 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):if(𝑁 = 0, ℤ, (0..^𝑁))–1-1-onto→𝐵) |
| 11 | 5, 10 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):if(𝑁 = 0, ℤ, (0..^𝑁))–1-1-onto→𝐵) |
| 12 | nnne0 9176 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
| 13 | ifnefalse 3617 | . . . . . 6 ⊢ (𝑁 ≠ 0 → if(𝑁 = 0, ℤ, (0..^𝑁)) = (0..^𝑁)) | |
| 14 | f1oeq2 5575 | . . . . . 6 ⊢ (if(𝑁 = 0, ℤ, (0..^𝑁)) = (0..^𝑁) → (((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):if(𝑁 = 0, ℤ, (0..^𝑁))–1-1-onto→𝐵 ↔ ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):(0..^𝑁)–1-1-onto→𝐵)) | |
| 15 | 12, 13, 14 | 3syl 17 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):if(𝑁 = 0, ℤ, (0..^𝑁))–1-1-onto→𝐵 ↔ ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):(0..^𝑁)–1-1-onto→𝐵)) |
| 16 | 11, 15 | mpbid 147 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):(0..^𝑁)–1-1-onto→𝐵) |
| 17 | f1oeng 6935 | . . . 4 ⊢ (((0..^𝑁) ∈ Fin ∧ ((ℤRHom‘𝑌) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))):(0..^𝑁)–1-1-onto→𝐵) → (0..^𝑁) ≈ 𝐵) | |
| 18 | 4, 16, 17 | syl2anc 411 | . . 3 ⊢ (𝑁 ∈ ℕ → (0..^𝑁) ≈ 𝐵) |
| 19 | 18 | ensymd 6962 | . 2 ⊢ (𝑁 ∈ ℕ → 𝐵 ≈ (0..^𝑁)) |
| 20 | enfii 7066 | . 2 ⊢ (((0..^𝑁) ∈ Fin ∧ 𝐵 ≈ (0..^𝑁)) → 𝐵 ∈ Fin) | |
| 21 | 4, 19, 20 | syl2anc 411 | 1 ⊢ (𝑁 ∈ ℕ → 𝐵 ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1397 ∈ wcel 2201 ≠ wne 2401 ifcif 3604 class class class wbr 4089 ↾ cres 4729 –1-1-onto→wf1o 5327 ‘cfv 5328 (class class class)co 6023 ≈ cen 6912 Fincfn 6914 0cc0 8037 ℕcn 9148 ℕ0cn0 9407 ℤcz 9484 ..^cfzo 10382 Basecbs 13105 ℤRHomczrh 14649 ℤ/nℤczn 14651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 ax-arch 8156 ax-addf 8159 ax-mulf 8160 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-tp 3678 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-po 4395 df-iso 4396 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-tpos 6416 df-recs 6476 df-frec 6562 df-1o 6587 df-er 6707 df-ec 6709 df-qs 6713 df-map 6824 df-en 6915 df-fin 6917 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-5 9210 df-6 9211 df-7 9212 df-8 9213 df-9 9214 df-n0 9408 df-z 9485 df-dec 9617 df-uz 9761 df-q 9859 df-rp 9894 df-fz 10249 df-fzo 10383 df-fl 10536 df-mod 10591 df-seqfrec 10716 df-cj 11425 df-abs 11582 df-dvds 12372 df-struct 13107 df-ndx 13108 df-slot 13109 df-base 13111 df-sets 13112 df-iress 13113 df-plusg 13196 df-mulr 13197 df-starv 13198 df-sca 13199 df-vsca 13200 df-ip 13201 df-tset 13202 df-ple 13203 df-ds 13205 df-unif 13206 df-0g 13364 df-topgen 13366 df-iimas 13408 df-qus 13409 df-mgm 13462 df-sgrp 13508 df-mnd 13523 df-mhm 13565 df-grp 13609 df-minusg 13610 df-sbg 13611 df-mulg 13730 df-subg 13780 df-nsg 13781 df-eqg 13782 df-ghm 13851 df-cmn 13896 df-abl 13897 df-mgp 13958 df-rng 13970 df-ur 13997 df-srg 14001 df-ring 14035 df-cring 14036 df-oppr 14105 df-dvdsr 14126 df-rhm 14190 df-subrg 14257 df-lmod 14327 df-lssm 14391 df-lsp 14425 df-sra 14473 df-rgmod 14474 df-lidl 14507 df-rsp 14508 df-2idl 14538 df-bl 14584 df-mopn 14585 df-fg 14587 df-metu 14588 df-cnfld 14595 df-zring 14629 df-zrh 14652 df-zn 14654 |
| This theorem is referenced by: znhash 14694 znidom 14695 znidomb 14696 |
| Copyright terms: Public domain | W3C validator |