| 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 2765 | . . . 4 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = ((𝐹 ∘ ≤ ) ∘ ◡𝐹) | |
| 7 | 1, 2, 3, 4, 5, 6 | znval 21740 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 8 | 7 | fveq2d 6890 | . 2 ⊢ (𝑁 ∈ ℕ0 → (le‘𝑌) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 9 | znle.l | . 2 ⊢ ≤ = (le‘𝑌) | |
| 10 | 2 | ovexi 7454 | . . 3 ⊢ 𝑈 ∈ V |
| 11 | fvex 6899 | . . . . . . 7 ⊢ (ℤRHom‘𝑈) ∈ V | |
| 12 | 11 | resex 6030 | . . . . . 6 ⊢ ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V |
| 13 | 4, 12 | eqeltri 2861 | . . . . 5 ⊢ 𝐹 ∈ V |
| 14 | xrex 13032 | . . . . . . 7 ⊢ ℝ* ∈ V | |
| 15 | 14, 14 | xpex 7759 | . . . . . 6 ⊢ (ℝ* × ℝ*) ∈ V |
| 16 | lerelxr 11292 | . . . . . 6 ⊢ ≤ ⊆ (ℝ* × ℝ*) | |
| 17 | 15, 16 | ssexi 5295 | . . . . 5 ⊢ ≤ ∈ V |
| 18 | 13, 17 | coex 7934 | . . . 4 ⊢ (𝐹 ∘ ≤ ) ∈ V |
| 19 | 13 | cnvex 7929 | . . . 4 ⊢ ◡𝐹 ∈ V |
| 20 | 18, 19 | coex 7934 | . . 3 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V |
| 21 | pleid 17447 | . . . 4 ⊢ le = Slot (le‘ndx) | |
| 22 | 21 | setsid 17294 | . . 3 ⊢ ((𝑈 ∈ V ∧ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V) → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 23 | 10, 20, 22 | mp2an 705 | . 2 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 24 | 8, 9, 23 | 3eqtr4g 2825 | 1 ⊢ (𝑁 ∈ ℕ0 → ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ifcif 4489 {csn 4591 〈cop 4597 × cxp 5661 ◡ccnv 5662 ↾ cres 5665 ∘ ccom 5667 ‘cfv 6541 (class class class)co 7420 0cc0 11120 ℝ*cxr 11262 ≤ cle 11264 ℕ0cn0 12524 ℤcz 12611 ..^cfzo 13704 sSet csts 17250 ndxcnx 17280 lecple 17344 /s cqus 17586 ~QG cqg 19237 RSpancrsp 21386 ℤringczring 21651 ℤRHomczrh 21704 ℤ/nℤczn 21707 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7743 ax-cnex 11176 ax-resscn 11177 ax-1cn 11178 ax-icn 11179 ax-addcl 11180 ax-addrcl 11181 ax-mulcl 11182 ax-mulrcl 11183 ax-mulcom 11184 ax-addass 11185 ax-mulass 11186 ax-distr 11187 ax-i2m1 11188 ax-1ne0 11189 ax-1rid 11190 ax-rnegex 11191 ax-rrecex 11192 ax-cnre 11193 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 ax-pre-mulgt0 11197 ax-addf 11199 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7870 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8460 df-er 8701 df-en 8951 df-dom 8952 df-sdom 8953 df-fin 8954 df-pnf 11265 df-mnf 11266 df-xr 11267 df-ltxr 11268 df-le 11269 df-sub 11463 df-neg 11464 df-nn 12254 df-2 12323 df-3 12324 df-4 12325 df-5 12326 df-6 12327 df-7 12328 df-8 12329 df-9 12330 df-n0 12525 df-z 12612 df-dec 12733 df-uz 12884 df-fz 13557 df-struct 17234 df-sets 17251 df-slot 17269 df-ndx 17281 df-base 17297 df-ress 17318 df-plusg 17350 df-mulr 17351 df-starv 17352 df-tset 17356 df-ple 17357 df-ds 17359 df-unif 17360 df-0g 17521 df-mgm 18725 df-sgrp 18814 df-mnd 18830 df-grp 19052 df-minusg 19053 df-subg 19238 df-cmn 19901 df-abl 19902 df-mgp 20266 df-rng 20280 df-ur 20313 df-ring 20366 df-cring 20367 df-subrng 20700 df-subrg 20724 df-cnfld 21578 df-zring 21652 df-zn 21711 |
| This theorem is used by: znval2 21742 znle2 21758 |
| Copyright terms: Public domain | W3C validator |