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 2738 | . . . 4 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = ((𝐹 ∘ ≤ ) ∘ ◡𝐹) | |
7 | 1, 2, 3, 4, 5, 6 | znval 20651 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
8 | 7 | fveq2d 6760 | . 2 ⊢ (𝑁 ∈ ℕ0 → (le‘𝑌) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
9 | znle.l | . 2 ⊢ ≤ = (le‘𝑌) | |
10 | 2 | ovexi 7289 | . . 3 ⊢ 𝑈 ∈ V |
11 | fvex 6769 | . . . . . . 7 ⊢ (ℤRHom‘𝑈) ∈ V | |
12 | 11 | resex 5928 | . . . . . 6 ⊢ ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V |
13 | 4, 12 | eqeltri 2835 | . . . . 5 ⊢ 𝐹 ∈ V |
14 | xrex 12656 | . . . . . . 7 ⊢ ℝ* ∈ V | |
15 | 14, 14 | xpex 7581 | . . . . . 6 ⊢ (ℝ* × ℝ*) ∈ V |
16 | lerelxr 10969 | . . . . . 6 ⊢ ≤ ⊆ (ℝ* × ℝ*) | |
17 | 15, 16 | ssexi 5241 | . . . . 5 ⊢ ≤ ∈ V |
18 | 13, 17 | coex 7751 | . . . 4 ⊢ (𝐹 ∘ ≤ ) ∈ V |
19 | 13 | cnvex 7746 | . . . 4 ⊢ ◡𝐹 ∈ V |
20 | 18, 19 | coex 7751 | . . 3 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V |
21 | pleid 17001 | . . . 4 ⊢ le = Slot (le‘ndx) | |
22 | 21 | setsid 16837 | . . 3 ⊢ ((𝑈 ∈ V ∧ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V) → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
23 | 10, 20, 22 | mp2an 688 | . 2 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
24 | 8, 9, 23 | 3eqtr4g 2804 | 1 ⊢ (𝑁 ∈ ℕ0 → ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ifcif 4456 {csn 4558 〈cop 4564 × cxp 5578 ◡ccnv 5579 ↾ cres 5582 ∘ ccom 5584 ‘cfv 6418 (class class class)co 7255 0cc0 10802 ℝ*cxr 10939 ≤ cle 10941 ℕ0cn0 12163 ℤcz 12249 ..^cfzo 13311 sSet csts 16792 ndxcnx 16822 lecple 16895 /s cqus 17133 ~QG cqg 18666 RSpancrsp 20348 ℤringzring 20582 ℤRHomczrh 20613 ℤ/nℤczn 20616 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-addf 10881 ax-mulf 10882 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-subg 18667 df-cmn 19303 df-mgp 19636 df-ur 19653 df-ring 19700 df-cring 19701 df-subrg 19937 df-cnfld 20511 df-zring 20583 df-zn 20620 |
This theorem is referenced by: znval2 20653 znle2 20673 |
Copyright terms: Public domain | W3C validator |