| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > znle | Structured version Visualization version GIF version | ||
| Description: The value of the ℤ/nℤ structure. It is defined as the quotient ring ℤ / 𝑛ℤ, with an "artificial" ordering added to make it a Toset. (In other words, ℤ/nℤ is a ring with an order , but it is not an ordered ring , which as a term implies that the order is compatible with the ring operations in some way.) (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by AV, 13-Jun-2019.) |
| Ref | Expression |
|---|---|
| znval.s | ⊢ 𝑆 = (RSpan‘ℤring) |
| znval.u | ⊢ 𝑈 = (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) |
| znval.y | ⊢ 𝑌 = (ℤ/nℤ‘𝑁) |
| znval.f | ⊢ 𝐹 = ((ℤRHom‘𝑈) ↾ 𝑊) |
| znval.w | ⊢ 𝑊 = if(𝑁 = 0, ℤ, (0..^𝑁)) |
| znle.l | ⊢ ≤ = (le‘𝑌) |
| Ref | Expression |
|---|---|
| znle | ⊢ (𝑁 ∈ ℕ0 → ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | znval.s | . . . 4 ⊢ 𝑆 = (RSpan‘ℤring) | |
| 2 | znval.u | . . . 4 ⊢ 𝑈 = (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) | |
| 3 | znval.y | . . . 4 ⊢ 𝑌 = (ℤ/nℤ‘𝑁) | |
| 4 | znval.f | . . . 4 ⊢ 𝐹 = ((ℤRHom‘𝑈) ↾ 𝑊) | |
| 5 | znval.w | . . . 4 ⊢ 𝑊 = if(𝑁 = 0, ℤ, (0..^𝑁)) | |
| 6 | eqid 2737 | . . . 4 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = ((𝐹 ∘ ≤ ) ∘ ◡𝐹) | |
| 7 | 1, 2, 3, 4, 5, 6 | znval 21529 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 8 | 7 | fveq2d 6840 | . 2 ⊢ (𝑁 ∈ ℕ0 → (le‘𝑌) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 9 | znle.l | . 2 ⊢ ≤ = (le‘𝑌) | |
| 10 | 2 | ovexi 7396 | . . 3 ⊢ 𝑈 ∈ V |
| 11 | fvex 6849 | . . . . . . 7 ⊢ (ℤRHom‘𝑈) ∈ V | |
| 12 | 11 | resex 5990 | . . . . . 6 ⊢ ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V |
| 13 | 4, 12 | eqeltri 2833 | . . . . 5 ⊢ 𝐹 ∈ V |
| 14 | xrex 12932 | . . . . . . 7 ⊢ ℝ* ∈ V | |
| 15 | 14, 14 | xpex 7702 | . . . . . 6 ⊢ (ℝ* × ℝ*) ∈ V |
| 16 | lerelxr 11203 | . . . . . 6 ⊢ ≤ ⊆ (ℝ* × ℝ*) | |
| 17 | 15, 16 | ssexi 5260 | . . . . 5 ⊢ ≤ ∈ V |
| 18 | 13, 17 | coex 7876 | . . . 4 ⊢ (𝐹 ∘ ≤ ) ∈ V |
| 19 | 13 | cnvex 7871 | . . . 4 ⊢ ◡𝐹 ∈ V |
| 20 | 18, 19 | coex 7876 | . . 3 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V |
| 21 | pleid 17325 | . . . 4 ⊢ le = Slot (le‘ndx) | |
| 22 | 21 | setsid 17172 | . . 3 ⊢ ((𝑈 ∈ V ∧ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V) → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 23 | 10, 20, 22 | mp2an 693 | . 2 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 24 | 8, 9, 23 | 3eqtr4g 2797 | 1 ⊢ (𝑁 ∈ ℕ0 → ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ifcif 4467 {csn 4568 〈cop 4574 × cxp 5624 ◡ccnv 5625 ↾ cres 5628 ∘ ccom 5630 ‘cfv 6494 (class class class)co 7362 0cc0 11033 ℝ*cxr 11173 ≤ cle 11175 ℕ0cn0 12432 ℤcz 12519 ..^cfzo 13603 sSet csts 17128 ndxcnx 17158 lecple 17222 /s cqus 17464 ~QG cqg 19093 RSpancrsp 21201 ℤringczring 21440 ℤRHomczrh 21493 ℤ/nℤczn 21496 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-addf 11112 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-1st 7937 df-2nd 7938 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-dec 12640 df-uz 12784 df-fz 13457 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-mulr 17229 df-starv 17230 df-tset 17234 df-ple 17235 df-ds 17237 df-unif 17238 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18907 df-minusg 18908 df-subg 19094 df-cmn 19752 df-abl 19753 df-mgp 20117 df-rng 20129 df-ur 20158 df-ring 20211 df-cring 20212 df-subrng 20518 df-subrg 20542 df-cnfld 21349 df-zring 21441 df-zn 21500 |
| This theorem is referenced by: znval2 21531 znle2 21547 |
| Copyright terms: Public domain | W3C validator |