| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > znval2 | Structured version Visualization version GIF version | ||
| Description: Self-referential expression for the ℤ/nℤ structure. (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by AV, 13-Jun-2019.) |
| Ref | Expression |
|---|---|
| znval2.s | ⊢ 𝑆 = (RSpan‘ℤring) |
| znval2.u | ⊢ 𝑈 = (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) |
| znval2.y | ⊢ 𝑌 = (ℤ/nℤ‘𝑁) |
| znval2.l | ⊢ ≤ = (le‘𝑌) |
| Ref | Expression |
|---|---|
| znval2 | ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ≤ 〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | znval2.s | . . 3 ⊢ 𝑆 = (RSpan‘ℤring) | |
| 2 | znval2.u | . . 3 ⊢ 𝑈 = (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) | |
| 3 | znval2.y | . . 3 ⊢ 𝑌 = (ℤ/nℤ‘𝑁) | |
| 4 | eqid 2763 | . . 3 ⊢ ((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) = ((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) | |
| 5 | eqid 2763 | . . 3 ⊢ if(𝑁 = 0, ℤ, (0..^𝑁)) = if(𝑁 = 0, ℤ, (0..^𝑁)) | |
| 6 | eqid 2763 | . . 3 ⊢ ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁)))) = ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁)))) | |
| 7 | 1, 2, 3, 4, 5, 6 | znval 21896 | . 2 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))))〉)) |
| 8 | znval2.l | . . . . 5 ⊢ ≤ = (le‘𝑌) | |
| 9 | 1, 2, 3, 4, 5, 8 | znle 21897 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ≤ = ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))))) |
| 10 | 9 | opeq2d 4852 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 〈(le‘ndx), ≤ 〉 = 〈(le‘ndx), ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))))〉) |
| 11 | 10 | oveq2d 7467 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑈 sSet 〈(le‘ndx), ≤ 〉) = (𝑈 sSet 〈(le‘ndx), ((((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))) ∘ ≤ ) ∘ ◡((ℤRHom‘𝑈) ↾ if(𝑁 = 0, ℤ, (0..^𝑁))))〉)) |
| 12 | 7, 11 | eqtr4d 2801 | 1 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet 〈(le‘ndx), ≤ 〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ifcif 4485 {csn 4588 〈cop 4840 ◡ccnv 5657 ↾ cres 5660 ∘ ccom 5662 ‘cfv 6566 (class class class)co 7451 0cc0 11239 ≤ cle 11383 ℕ0cn0 12646 ℤcz 12733 ..^cfzo 13828 sSet csts 17385 ndxcnx 17415 lecple 17479 /s cqus 17727 ~QG cqg 19382 RSpancrsp 21536 ℤringczring 21806 ℤRHomczrh 21860 ℤ/nℤczn 21863 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-addf 11318 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-starv 17488 df-tset 17492 df-ple 17493 df-ds 17495 df-unif 17496 df-euf 17499 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-subg 19383 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-cring 20513 df-subrng 20849 df-subrg 20873 df-cnfld 21730 df-zring 21807 df-zn 21867 |
| This theorem is used by: znbaslem 21899 |
| Copyright terms: Public domain | W3C validator |