| 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 21507 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉)) |
| 8 | 7 | fveq2d 6848 | . 2 ⊢ (𝑁 ∈ ℕ0 → (le‘𝑌) = (le‘(𝑈 sSet 〈(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ◡𝐹)〉))) |
| 9 | znle.l | . 2 ⊢ ≤ = (le‘𝑌) | |
| 10 | 2 | ovexi 7404 | . . 3 ⊢ 𝑈 ∈ V |
| 11 | fvex 6857 | . . . . . . 7 ⊢ (ℤRHom‘𝑈) ∈ V | |
| 12 | 11 | resex 5998 | . . . . . 6 ⊢ ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V |
| 13 | 4, 12 | eqeltri 2833 | . . . . 5 ⊢ 𝐹 ∈ V |
| 14 | xrex 12914 | . . . . . . 7 ⊢ ℝ* ∈ V | |
| 15 | 14, 14 | xpex 7710 | . . . . . 6 ⊢ (ℝ* × ℝ*) ∈ V |
| 16 | lerelxr 11209 | . . . . . 6 ⊢ ≤ ⊆ (ℝ* × ℝ*) | |
| 17 | 15, 16 | ssexi 5271 | . . . . 5 ⊢ ≤ ∈ V |
| 18 | 13, 17 | coex 7884 | . . . 4 ⊢ (𝐹 ∘ ≤ ) ∈ V |
| 19 | 13 | cnvex 7879 | . . . 4 ⊢ ◡𝐹 ∈ V |
| 20 | 18, 19 | coex 7884 | . . 3 ⊢ ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V |
| 21 | pleid 17301 | . . . 4 ⊢ le = Slot (le‘ndx) | |
| 22 | 21 | setsid 17148 | . . 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 3442 ifcif 4481 {csn 4582 〈cop 4588 × cxp 5632 ◡ccnv 5633 ↾ cres 5636 ∘ ccom 5638 ‘cfv 6502 (class class class)co 7370 0cc0 11040 ℝ*cxr 11179 ≤ cle 11181 ℕ0cn0 12415 ℤcz 12502 ..^cfzo 13584 sSet csts 17104 ndxcnx 17134 lecple 17198 /s cqus 17440 ~QG cqg 19069 RSpancrsp 21179 ℤringczring 21418 ℤRHomczrh 21471 ℤ/nℤczn 21474 |
| 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 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-addf 11119 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-dec 12622 df-uz 12766 df-fz 13438 df-struct 17088 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-mulr 17205 df-starv 17206 df-tset 17210 df-ple 17211 df-ds 17213 df-unif 17214 df-0g 17375 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-grp 18883 df-minusg 18884 df-subg 19070 df-cmn 19728 df-abl 19729 df-mgp 20093 df-rng 20105 df-ur 20134 df-ring 20187 df-cring 20188 df-subrng 20496 df-subrg 20520 df-cnfld 21327 df-zring 21419 df-zn 21478 |
| This theorem is referenced by: znval2 21509 znle2 21525 |
| Copyright terms: Public domain | W3C validator |