| 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 2736 | . . . 4 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = ((𝐹 ∘ ≤ ) ∘ ◡𝐹) | |
| 7 | 1, 2, 3, 4, 5, 6 | znval 21492 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 8 | 7 | fveq2d 6838 | . 2 ⊢ (𝑁 ∈ ℕ0 → (le‘𝑌) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 9 | znle.l | . 2 ⊢ ≤ = (le‘𝑌) | |
| 10 | 2 | ovexi 7392 | . . 3 ⊢ 𝑈 ∈ V |
| 11 | fvex 6847 | . . . . . . 7 ⊢ (ℤRHom‘𝑈) ∈ V | |
| 12 | 11 | resex 5988 | . . . . . 6 ⊢ ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V |
| 13 | 4, 12 | eqeltri 2832 | . . . . 5 ⊢ 𝐹 ∈ V |
| 14 | xrex 12902 | . . . . . . 7 ⊢ ℝ* ∈ V | |
| 15 | 14, 14 | xpex 7698 | . . . . . 6 ⊢ (ℝ* × ℝ*) ∈ V |
| 16 | lerelxr 11197 | . . . . . 6 ⊢ ≤ ⊆ (ℝ* × ℝ*) | |
| 17 | 15, 16 | ssexi 5267 | . . . . 5 ⊢ ≤ ∈ V |
| 18 | 13, 17 | coex 7872 | . . . 4 ⊢ (𝐹 ∘ ≤ ) ∈ V |
| 19 | 13 | cnvex 7867 | . . . 4 ⊢ ◡𝐹 ∈ V |
| 20 | 18, 19 | coex 7872 | . . 3 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V |
| 21 | pleid 17289 | . . . 4 ⊢ le = Slot (le‘ndx) | |
| 22 | 21 | setsid 17136 | . . 3 ⊢ ((𝑈 ∈ V ∧ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V) → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 23 | 10, 20, 22 | mp2an 692 | . 2 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 24 | 8, 9, 23 | 3eqtr4g 2796 | 1 ⊢ (𝑁 ∈ ℕ0 → ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3440 ifcif 4479 {csn 4580 〈cop 4586 × cxp 5622 ◡ccnv 5623 ↾ cres 5626 ∘ ccom 5628 ‘cfv 6492 (class class class)co 7358 0cc0 11028 ℝ*cxr 11167 ≤ cle 11169 ℕ0cn0 12403 ℤcz 12490 ..^cfzo 13572 sSet csts 17092 ndxcnx 17122 lecple 17186 /s cqus 17428 ~QG cqg 19054 RSpancrsp 21164 ℤringczring 21403 ℤRHomczrh 21456 ℤ/nℤczn 21459 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-addf 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-2 12210 df-3 12211 df-4 12212 df-5 12213 df-6 12214 df-7 12215 df-8 12216 df-9 12217 df-n0 12404 df-z 12491 df-dec 12610 df-uz 12754 df-fz 13426 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-mulr 17193 df-starv 17194 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-0g 17363 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-subg 19055 df-cmn 19713 df-abl 19714 df-mgp 20078 df-rng 20090 df-ur 20119 df-ring 20172 df-cring 20173 df-subrng 20481 df-subrg 20505 df-cnfld 21312 df-zring 21404 df-zn 21463 |
| This theorem is referenced by: znval2 21494 znle2 21510 |
| Copyright terms: Public domain | W3C validator |