| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 1arithufd | Structured version Visualization version GIF version | ||
| Description: Existence of a factorization into irreducible elements in a unique factorization domain. Any nonzero, non-unit element 𝑋 of a UFD 𝑅 can be written as a product of primes 𝑓. As shown in 1arithidom 33805, that factorization is unique, up to the order of the factors and multiplication by units. (Contributed by Thierry Arnoux, 3-Jun-2025.) |
| Ref | Expression |
|---|---|
| 1arithufd.b | ⊢ 𝐵 = (Base‘𝑅) |
| 1arithufd.0 | ⊢ 0 = (0g‘𝑅) |
| 1arithufd.u | ⊢ 𝑈 = (Unit‘𝑅) |
| 1arithufd.p | ⊢ 𝑃 = (RPrime‘𝑅) |
| 1arithufd.m | ⊢ 𝑀 = (mulGrp‘𝑅) |
| 1arithufd.r | ⊢ (𝜑 → 𝑅 ∈ UFD) |
| 1arithufd.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| 1arithufd.2 | ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) |
| 1arithufd.3 | ⊢ (𝜑 → 𝑋 ≠ 0 ) |
| Ref | Expression |
|---|---|
| 1arithufd | ⊢ (𝜑 → ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → 𝑅 ∈ DivRing) | |
| 2 | 1arithufd.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 3 | 2 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → 𝑋 ∈ 𝐵) |
| 4 | 1arithufd.3 | . . . . 5 ⊢ (𝜑 → 𝑋 ≠ 0 ) | |
| 5 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → 𝑋 ≠ 0 ) |
| 6 | 1arithufd.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 7 | 1arithufd.u | . . . . . 6 ⊢ 𝑈 = (Unit‘𝑅) | |
| 8 | 1arithufd.0 | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 9 | 6, 7, 8 | drngunit 20819 | . . . . 5 ⊢ (𝑅 ∈ DivRing → (𝑋 ∈ 𝑈 ↔ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ))) |
| 10 | 9 | biimpar 482 | . . . 4 ⊢ ((𝑅 ∈ DivRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ∈ 𝑈) |
| 11 | 1, 3, 5, 10 | syl12anc 849 | . . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → 𝑋 ∈ 𝑈) |
| 12 | 1arithufd.2 | . . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) | |
| 13 | 12 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → ¬ 𝑋 ∈ 𝑈) |
| 14 | 11, 13 | pm2.21dd 198 | . 2 ⊢ ((𝜑 ∧ 𝑅 ∈ DivRing) → ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓)) |
| 15 | 1arithufd.p | . . . . 5 ⊢ 𝑃 = (RPrime‘𝑅) | |
| 16 | 1arithufd.m | . . . . 5 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 17 | 1arithufd.r | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ UFD) | |
| 18 | 17 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → 𝑅 ∈ UFD) |
| 19 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → ¬ 𝑅 ∈ DivRing) | |
| 20 | eqeq1 2767 | . . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 = (𝑀 Σg 𝑓) ↔ 𝑥 = (𝑀 Σg 𝑓))) | |
| 21 | 20 | rexbidv 3189 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓))) |
| 22 | 21 | cbvrabv 3426 | . . . . . 6 ⊢ {𝑦 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓)} = {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)} |
| 23 | oveq2 7420 | . . . . . . . 8 ⊢ (𝑓 = 𝑔 → (𝑀 Σg 𝑓) = (𝑀 Σg 𝑔)) | |
| 24 | 23 | eqeq2d 2774 | . . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑥 = (𝑀 Σg 𝑓) ↔ 𝑥 = (𝑀 Σg 𝑔))) |
| 25 | 24 | cbvrexvw 3244 | . . . . . 6 ⊢ (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑔 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑔)) |
| 26 | 22, 25 | rabbieq 3424 | . . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓)} = {𝑥 ∈ 𝐵 ∣ ∃𝑔 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑔)} |
| 27 | 2 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → 𝑋 ∈ 𝐵) |
| 28 | 12 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → ¬ 𝑋 ∈ 𝑈) |
| 29 | 4 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → 𝑋 ≠ 0 ) |
| 30 | 6, 8, 7, 15, 16, 18, 19, 26, 27, 28, 29 | 1arithufdlem4 33815 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → 𝑋 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓)}) |
| 31 | eqeq1 2767 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (𝑦 = (𝑀 Σg 𝑓) ↔ 𝑋 = (𝑀 Σg 𝑓))) | |
| 32 | 31 | rexbidv 3189 | . . . . 5 ⊢ (𝑦 = 𝑋 → (∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓))) |
| 33 | 32 | elrab 3651 | . . . 4 ⊢ (𝑋 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑦 = (𝑀 Σg 𝑓)} ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓))) |
| 34 | 30, 33 | sylib 221 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → (𝑋 ∈ 𝐵 ∧ ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓))) |
| 35 | 34 | simprd 500 | . 2 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ DivRing) → ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓)) |
| 36 | 14, 35 | pm2.61dan 824 | 1 ⊢ (𝜑 → ∃𝑓 ∈ Word 𝑃𝑋 = (𝑀 Σg 𝑓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3089 {crab 3416 ‘cfv 6538 (class class class)co 7412 Word cword 14552 Basecbs 17270 0gc0g 17493 Σg cgsu 17494 mulGrpcmgp 20217 Unitcui 20438 RPrimecrpm 20515 DivRingcdr 20814 UFDcufd 33806 |
| This theorem was proved from 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-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-ac2 10448 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 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-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-rpss 7722 df-om 7864 df-1st 7987 df-2nd 7988 df-supp 8158 df-tpos 8223 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-oadd 8458 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-fsupp 9323 df-oi 9473 df-dju 9888 df-card 9926 df-ac 10101 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-5 12307 df-6 12308 df-7 12309 df-8 12310 df-n0 12506 df-xnn0 12579 df-z 12593 df-uz 12864 df-fz 13537 df-fzo 13685 df-seq 14040 df-hash 14369 df-word 14553 df-lsw 14602 df-concat 14610 df-s1 14636 df-substr 14681 df-pfx 14711 df-sets 17225 df-slot 17243 df-ndx 17255 df-base 17271 df-ress 17292 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-0g 17495 df-gsum 17496 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-submnd 18843 df-grp 19004 df-minusg 19005 df-sbg 19006 df-subg 19190 df-cntz 19388 df-lsm 19707 df-cmn 19853 df-abl 19854 df-mgp 20218 df-rng 20232 df-ur 20265 df-ring 20318 df-cring 20319 df-oppr 20420 df-dvdsr 20440 df-unit 20441 df-invr 20471 df-rprm 20516 df-nzr 20597 df-subrg 20656 df-domn 20781 df-idom 20782 df-drng 20816 df-lmod 20964 df-lss 21034 df-lsp 21074 df-sra 21275 df-rgmod 21276 df-lidl 21313 df-rsp 21314 df-prmidl 21442 df-ufd 33807 |
| This theorem is referenced by: dfufd2 33818 |
| Copyright terms: Public domain | W3C validator |