znle - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > znle		GIF version

Theorem znle 14641

Description: The value of the ℤ/nℤ structure. It is defined as the quotient ring ℤ / 𝑛ℤ, with an "artificial" ordering added. (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.)

**Hypotheses**
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‘𝑌)

**Assertion**
Ref	Expression
znle	⊢ (𝑁 ∈ ℕ₀ → ≤ = ((𝐹 ∘ ≤ ) ∘ ^◡𝐹))

**Proof of Theorem znle**
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 2229	. . . 4 ⊢ ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) = ((𝐹 ∘ ≤ ) ∘ ^◡𝐹)
7	1, 2, 3, 4, 5, 6	znval 14640	. . 3 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 = (𝑈 sSet ⟨(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ^◡𝐹)⟩))
8	7	fveq2d 5639	. 2 ⊢ (𝑁 ∈ ℕ₀ → (le‘𝑌) = (le‘(𝑈 sSet ⟨(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ^◡𝐹)⟩)))
9		znle.l	. . 3 ⊢ ≤ = (le‘𝑌)
10	9	a1i 9	. 2 ⊢ (𝑁 ∈ ℕ₀ → ≤ = (le‘𝑌))
11		zringring 14597	. . . . 5 ⊢ ℤ_ring ∈ Ring
12		rspex 14478	. . . . . . . . 9 ⊢ (ℤ_ring ∈ Ring → (RSpan‘ℤ_ring) ∈ V)
13	11, 12	ax-mp 5	. . . . . . . 8 ⊢ (RSpan‘ℤ_ring) ∈ V
14	1, 13	eqeltri 2302	. . . . . . 7 ⊢ 𝑆 ∈ V
15		snexg 4272	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → {𝑁} ∈ V)
16		fvexg 5654	. . . . . . 7 ⊢ ((𝑆 ∈ V ∧ {𝑁} ∈ V) → (𝑆‘{𝑁}) ∈ V)
17	14, 15, 16	sylancr 414	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → (𝑆‘{𝑁}) ∈ V)
18		eqgex 13798	. . . . . 6 ⊢ ((ℤ_ring ∈ Ring ∧ (𝑆‘{𝑁}) ∈ V) → (ℤ_ring ~_QG (𝑆‘{𝑁})) ∈ V)
19	11, 17, 18	sylancr 414	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (ℤ_ring ~_QG (𝑆‘{𝑁})) ∈ V)
20		qusex 13398	. . . . 5 ⊢ ((ℤ_ring ∈ Ring ∧ (ℤ_ring ~_QG (𝑆‘{𝑁})) ∈ V) → (ℤ_ring /_s (ℤ_ring ~_QG (𝑆‘{𝑁}))) ∈ V)
21	11, 19, 20	sylancr 414	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → (ℤ_ring /_s (ℤ_ring ~_QG (𝑆‘{𝑁}))) ∈ V)
22	2, 21	eqeltrid 2316	. . 3 ⊢ (𝑁 ∈ ℕ₀ → 𝑈 ∈ V)
23		eqid 2229	. . . . . . . 8 ⊢ (ℤRHom‘𝑈) = (ℤRHom‘𝑈)
24	23	zrhex 14625	. . . . . . 7 ⊢ (𝑈 ∈ V → (ℤRHom‘𝑈) ∈ V)
25		resexg 5051	. . . . . . 7 ⊢ ((ℤRHom‘𝑈) ∈ V → ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V)
26	22, 24, 25	3syl 17	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V)
27	4, 26	eqeltrid 2316	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → 𝐹 ∈ V)
28		xrex 10081	. . . . . . 7 ⊢ ℝ^* ∈ V
29	28, 28	xpex 4840	. . . . . 6 ⊢ (ℝ^* × ℝ^*) ∈ V
30		lerelxr 8232	. . . . . 6 ⊢ ≤ ⊆ (ℝ^* × ℝ^*)
31	29, 30	ssexi 4225	. . . . 5 ⊢ ≤ ∈ V
32		coexg 5279	. . . . 5 ⊢ ((𝐹 ∈ V ∧ ≤ ∈ V) → (𝐹 ∘ ≤ ) ∈ V)
33	27, 31, 32	sylancl 413	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → (𝐹 ∘ ≤ ) ∈ V)
34		cnvexg 5272	. . . . 5 ⊢ (𝐹 ∈ V → ^◡𝐹 ∈ V)
35	27, 34	syl 14	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → ^◡𝐹 ∈ V)
36		coexg 5279	. . . 4 ⊢ (((𝐹 ∘ ≤ ) ∈ V ∧ ^◡𝐹 ∈ V) → ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) ∈ V)
37	33, 35, 36	syl2anc 411	. . 3 ⊢ (𝑁 ∈ ℕ₀ → ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) ∈ V)
38		pleslid 13275	. . . 4 ⊢ (le = Slot (le‘ndx) ∧ (le‘ndx) ∈ ℕ)
39	38	setsslid 13123	. . 3 ⊢ ((𝑈 ∈ V ∧ ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) ∈ V) → ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) = (le‘(𝑈 sSet ⟨(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ^◡𝐹)⟩)))
40	22, 37, 39	syl2anc 411	. 2 ⊢ (𝑁 ∈ ℕ₀ → ((𝐹 ∘ ≤ ) ∘ ^◡𝐹) = (le‘(𝑈 sSet ⟨(le‘ndx), ((𝐹 ∘ ≤ ) ∘ ^◡𝐹)⟩)))
41	8, 10, 40	3eqtr4d 2272	1 ⊢ (𝑁 ∈ ℕ₀ → ≤ = ((𝐹 ∘ ≤ ) ∘ ^◡𝐹))

Colors of variables: wff set class

Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2800 ifcif 3603 {csn 3667 ⟨cop 3670 × cxp 4721 ^◡ccnv 4722 ↾ cres 4725 ∘ ccom 4727 ‘cfv 5324 (class class class)co 6013 0cc0 8022 ℝ^*cxr 8203 ≤ cle 8205 ℕ₀cn0 9392 ℤcz 9469 ..^cfzo 10367 ndxcnx 13069 sSet csts 13070 lecple 13157 /_s cqus 13373 ~_QG cqg 13746 Ringcrg 13999 RSpancrsp 14472 ℤ_ringczring 14594 ℤRHomczrh 14615 ℤ/nℤczn 14617

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-addf 8144 ax-mulf 8145

This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-tp 3675 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-ec 6699 df-map 6814 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-5 9195 df-6 9196 df-7 9197 df-8 9198 df-9 9199 df-n0 9393 df-z 9470 df-dec 9602 df-uz 9746 df-rp 9879 df-fz 10234 df-cj 11393 df-abs 11550 df-struct 13074 df-ndx 13075 df-slot 13076 df-base 13078 df-sets 13079 df-iress 13080 df-plusg 13163 df-mulr 13164 df-starv 13165 df-sca 13166 df-vsca 13167 df-ip 13168 df-tset 13169 df-ple 13170 df-ds 13172 df-unif 13173 df-0g 13331 df-topgen 13333 df-iimas 13375 df-qus 13376 df-mgm 13429 df-sgrp 13475 df-mnd 13490 df-grp 13576 df-minusg 13577 df-subg 13747 df-eqg 13749 df-cmn 13863 df-mgp 13924 df-ur 13963 df-ring 14001 df-cring 14002 df-rhm 14156 df-subrg 14223 df-lsp 14391 df-sra 14439 df-rgmod 14440 df-rsp 14474 df-bl 14550 df-mopn 14551 df-fg 14553 df-metu 14554 df-cnfld 14561 df-zring 14595 df-zrh 14618 df-zn 14620

This theorem is referenced by: znval2 14642 znle2 14656

W3C validator