Theorem znval 14656

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 Mario Carneiro, 2-May-2016.) (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..^𝑁))
znval.l	⊢ ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)

Assertion

Ref	Expression
znval	⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))

Proof of Theorem znval

Dummy variables 𝑓 𝑛 𝑠 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		znval.y	. 2 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
2		df-zn 14636	. . 3 ⊢ ℤ/nℤ = (𝑛 ∈ ℕ0 ↦ ⦋ℤring / 𝑧⦌⦋(𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) / 𝑠⦌(𝑠 sSet ⟨(le‘ndx), ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓)⟩))
3		zringring 14613	. . . . 5 ⊢ ℤring ∈ Ring
4	3	a1i 9	. . . 4 ⊢ (𝑛 = 𝑁 → ℤring ∈ Ring)
5		vex 2805	. . . . . . 7 ⊢ 𝑧 ∈ V
6		rspex 14494	. . . . . . . . . 10 ⊢ (𝑧 ∈ V → (RSpan‘𝑧) ∈ V)
7	6	elv 2806	. . . . . . . . 9 ⊢ (RSpan‘𝑧) ∈ V
8		vex 2805	. . . . . . . . . 10 ⊢ 𝑛 ∈ V
9	8	snex 4275	. . . . . . . . 9 ⊢ {𝑛} ∈ V
10	7, 9	fvex 5659	. . . . . . . 8 ⊢ ((RSpan‘𝑧)‘{𝑛}) ∈ V
11		eqgex 13813	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ ((RSpan‘𝑧)‘{𝑛}) ∈ V) → (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})) ∈ V)
12	5, 10, 11	mp2an 426	. . . . . . 7 ⊢ (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})) ∈ V
13		qusex 13413	. . . . . . 7 ⊢ ((𝑧 ∈ V ∧ (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})) ∈ V) → (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) ∈ V)
14	5, 12, 13	mp2an 426	. . . . . 6 ⊢ (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) ∈ V
15	14	a1i 9	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) ∈ V)
16		id 19	. . . . . . 7 ⊢ (𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) → 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))))
17		simpr 110	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → 𝑧 = ℤring)
18	17	fveq2d 5643	. . . . . . . . . . . 12 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (RSpan‘𝑧) = (RSpan‘ℤring))
19		znval.s	. . . . . . . . . . . 12 ⊢ 𝑆 = (RSpan‘ℤring)
20	18, 19	eqtr4di 2282	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (RSpan‘𝑧) = 𝑆)
21		simpl 109	. . . . . . . . . . . 12 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → 𝑛 = 𝑁)
22	21	sneqd 3682	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → {𝑛} = {𝑁})
23	20, 22	fveq12d 5646	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → ((RSpan‘𝑧)‘{𝑛}) = (𝑆‘{𝑁}))
24	17, 23	oveq12d 6036	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})) = (ℤring ~QG (𝑆‘{𝑁})))
25	17, 24	oveq12d 6036	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) = (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))))
26		znval.u	. . . . . . . 8 ⊢ 𝑈 = (ℤring /s (ℤring ~QG (𝑆‘{𝑁})))
27	25, 26	eqtr4di 2282	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) = 𝑈)
28	16, 27	sylan9eqr 2286	. . . . . 6 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → 𝑠 = 𝑈)
29		eqid 2231	. . . . . . . . . . . 12 ⊢ (ℤRHom‘𝑠) = (ℤRHom‘𝑠)
30	29	zrhex 14641	. . . . . . . . . . 11 ⊢ (𝑠 ∈ V → (ℤRHom‘𝑠) ∈ V)
31	30	elv 2806	. . . . . . . . . 10 ⊢ (ℤRHom‘𝑠) ∈ V
32	31	resex 5054	. . . . . . . . 9 ⊢ ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) ∈ V
33	32	a1i 9	. . . . . . . 8 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) ∈ V)
34		id 19	. . . . . . . . . . . 12 ⊢ (𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) → 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))))
35	28	fveq2d 5643	. . . . . . . . . . . . . 14 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → (ℤRHom‘𝑠) = (ℤRHom‘𝑈))
36		simpll 527	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → 𝑛 = 𝑁)
37	36	eqeq1d 2240	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → (𝑛 = 0 ↔ 𝑁 = 0))
38	36	oveq2d 6034	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → (0..^𝑛) = (0..^𝑁))
39	37, 38	ifbieq2d 3630	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → if(𝑛 = 0, ℤ, (0..^𝑛)) = if(𝑁 = 0, ℤ, (0..^𝑁)))
40		znval.w	. . . . . . . . . . . . . . 15 ⊢ 𝑊 = if(𝑁 = 0, ℤ, (0..^𝑁))
41	39, 40	eqtr4di 2282	. . . . . . . . . . . . . 14 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → if(𝑛 = 0, ℤ, (0..^𝑛)) = 𝑊)
42	35, 41	reseq12d 5014	. . . . . . . . . . . . 13 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) = ((ℤRHom‘𝑈) ↾ 𝑊))
43		znval.f	. . . . . . . . . . . . 13 ⊢ 𝐹 = ((ℤRHom‘𝑈) ↾ 𝑊)
44	42, 43	eqtr4di 2282	. . . . . . . . . . . 12 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) = 𝐹)
45	34, 44	sylan9eqr 2286	. . . . . . . . . . 11 ⊢ ((((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) ∧ 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛)))) → 𝑓 = 𝐹)
46	45	coeq1d 4891	. . . . . . . . . 10 ⊢ ((((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) ∧ 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛)))) → (𝑓 ∘ ≤ ) = (𝐹 ∘ ≤ ))
47	45	cnveqd 4906	. . . . . . . . . 10 ⊢ ((((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) ∧ 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛)))) → ◡𝑓 = ◡𝐹)
48	46, 47	coeq12d 4894	. . . . . . . . 9 ⊢ ((((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) ∧ 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛)))) → ((𝑓 ∘ ≤ ) ∘ ◡𝑓) = ((𝐹 ∘ ≤ ) ∘ ◡𝐹))
49		znval.l	. . . . . . . . 9 ⊢ ≤ = ((𝐹 ∘ ≤ ) ∘ ◡𝐹)
50	48, 49	eqtr4di 2282	. . . . . . . 8 ⊢ ((((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) ∧ 𝑓 = ((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛)))) → ((𝑓 ∘ ≤ ) ∘ ◡𝑓) = ≤ )
51	33, 50	csbied 3174	. . . . . . 7 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓) = ≤ )
52	51	opeq2d 3869	. . . . . 6 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → ⟨(le‘ndx), ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓)⟩ = ⟨(le‘ndx), ≤ ⟩)
53	28, 52	oveq12d 6036	. . . . 5 ⊢ (((𝑛 = 𝑁 ∧ 𝑧 = ℤring) ∧ 𝑠 = (𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛})))) → (𝑠 sSet ⟨(le‘ndx), ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓)⟩) = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))
54	15, 53	csbied 3174	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑧 = ℤring) → ⦋(𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) / 𝑠⦌(𝑠 sSet ⟨(le‘ndx), ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓)⟩) = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))
55	4, 54	csbied 3174	. . 3 ⊢ (𝑛 = 𝑁 → ⦋ℤring / 𝑧⦌⦋(𝑧 /s (𝑧 ~QG ((RSpan‘𝑧)‘{𝑛}))) / 𝑠⦌(𝑠 sSet ⟨(le‘ndx), ⦋((ℤRHom‘𝑠) ↾ if(𝑛 = 0, ℤ, (0..^𝑛))) / 𝑓⦌((𝑓 ∘ ≤ ) ∘ ◡𝑓)⟩) = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))
56		id 19	. . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℕ0)
57		rspex 14494	. . . . . . . . . 10 ⊢ (ℤring ∈ Ring → (RSpan‘ℤring) ∈ V)
58	3, 57	ax-mp 5	. . . . . . . . 9 ⊢ (RSpan‘ℤring) ∈ V
59	19, 58	eqeltri 2304	. . . . . . . 8 ⊢ 𝑆 ∈ V
60		snexg 4274	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → {𝑁} ∈ V)
61		fvexg 5658	. . . . . . . 8 ⊢ ((𝑆 ∈ V ∧ {𝑁} ∈ V) → (𝑆‘{𝑁}) ∈ V)
62	59, 60, 61	sylancr 414	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑆‘{𝑁}) ∈ V)
63		eqgex 13813	. . . . . . 7 ⊢ ((ℤring ∈ Ring ∧ (𝑆‘{𝑁}) ∈ V) → (ℤring ~QG (𝑆‘{𝑁})) ∈ V)
64	3, 62, 63	sylancr 414	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (ℤring ~QG (𝑆‘{𝑁})) ∈ V)
65		qusex 13413	. . . . . 6 ⊢ ((ℤring ∈ Ring ∧ (ℤring ~QG (𝑆‘{𝑁})) ∈ V) → (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) ∈ V)
66	3, 64, 65	sylancr 414	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → (ℤring /s (ℤring ~QG (𝑆‘{𝑁}))) ∈ V)
67	26, 66	eqeltrid 2318	. . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑈 ∈ V)
68		plendxnn 13291	. . . . 5 ⊢ (le‘ndx) ∈ ℕ
69	68	a1i 9	. . . 4 ⊢ (𝑁 ∈ ℕ0 → (le‘ndx) ∈ ℕ)
70		eqid 2231	. . . . . . . . . . 11 ⊢ (ℤRHom‘𝑈) = (ℤRHom‘𝑈)
71	70	zrhex 14641	. . . . . . . . . 10 ⊢ (𝑈 ∈ V → (ℤRHom‘𝑈) ∈ V)
72	67, 71	syl 14	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (ℤRHom‘𝑈) ∈ V)
73		resexg 5053	. . . . . . . . 9 ⊢ ((ℤRHom‘𝑈) ∈ V → ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V)
74	72, 73	syl 14	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ((ℤRHom‘𝑈) ↾ 𝑊) ∈ V)
75	43, 74	eqeltrid 2318	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝐹 ∈ V)
76		xrex 10091	. . . . . . . . 9 ⊢ ℝ* ∈ V
77	76, 76	xpex 4842	. . . . . . . 8 ⊢ (ℝ* × ℝ*) ∈ V
78		lerelxr 8242	. . . . . . . 8 ⊢ ≤ ⊆ (ℝ* × ℝ*)
79	77, 78	ssexi 4227	. . . . . . 7 ⊢ ≤ ∈ V
80		coexg 5281	. . . . . . 7 ⊢ ((𝐹 ∈ V ∧ ≤ ∈ V) → (𝐹 ∘ ≤ ) ∈ V)
81	75, 79, 80	sylancl 413	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝐹 ∘ ≤ ) ∈ V)
82		cnvexg 5274	. . . . . . 7 ⊢ (𝐹 ∈ V → ◡𝐹 ∈ V)
83	75, 82	syl 14	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ◡𝐹 ∈ V)
84		coexg 5281	. . . . . 6 ⊢ (((𝐹 ∘ ≤ ) ∈ V ∧ ◡𝐹 ∈ V) → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V)
85	81, 83, 84	syl2anc 411	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((𝐹 ∘ ≤ ) ∘ ◡𝐹) ∈ V)
86	49, 85	eqeltrid 2318	. . . 4 ⊢ (𝑁 ∈ ℕ0 → ≤ ∈ V)
87		setsex 13119	. . . 4 ⊢ ((𝑈 ∈ V ∧ (le‘ndx) ∈ ℕ ∧ ≤ ∈ V) → (𝑈 sSet ⟨(le‘ndx), ≤ ⟩) ∈ V)
88	67, 69, 86, 87	syl3anc 1273	. . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑈 sSet ⟨(le‘ndx), ≤ ⟩) ∈ V)
89	2, 55, 56, 88	fvmptd3 5740	. 2 ⊢ (𝑁 ∈ ℕ0 → (ℤ/nℤ‘𝑁) = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))
90	1, 89	eqtrid 2276	1 ⊢ (𝑁 ∈ ℕ0 → 𝑌 = (𝑈 sSet ⟨(le‘ndx), ≤ ⟩))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1397   ∈ wcel 2202  Vcvv 2802  ⦋csb 3127  ifcif 3605  {csn 3669  ⟨cop 3672   × cxp 4723  ^◡ccnv 4724   ↾ cres 4727   ∘ ccom 4729  ‘cfv 5326  (class class class)co 6018  0cc0 8032  ℝ^*cxr 8213   ≤ cle 8215  ℕcn 9143  ℕ₀cn0 9402  ℤcz 9479  ..^cfzo 10377  ndxcnx 13084   sSet csts 13085  lecple 13172   /_s cqus 13388   ~_QG cqg 13761  Ringcrg 14015  RSpancrsp 14488  ℤ_ringczring 14610  ℤRHomczrh 14631  ℤ/nℤczn 14633

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-addf 8154  ax-mulf 8155

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-tp 3677  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-ec 6704  df-map 6819  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-9 9209  df-n0 9403  df-z 9480  df-dec 9612  df-uz 9756  df-rp 9889  df-fz 10244  df-cj 11407  df-abs 11564  df-struct 13089  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095  df-plusg 13178  df-mulr 13179  df-starv 13180  df-sca 13181  df-vsca 13182  df-ip 13183  df-tset 13184  df-ple 13185  df-ds 13187  df-unif 13188  df-0g 13346  df-topgen 13348  df-iimas 13390  df-qus 13391  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-minusg 13592  df-subg 13762  df-eqg 13764  df-cmn 13878  df-mgp 13940  df-ur 13979  df-ring 14017  df-cring 14018  df-rhm 14172  df-subrg 14239  df-lsp 14407  df-sra 14455  df-rgmod 14456  df-rsp 14490  df-bl 14566  df-mopn 14567  df-fg 14569  df-metu 14570  df-cnfld 14577  df-zring 14611  df-zrh 14634  df-zn 14636

This theorem is referenced by:  znle  14657  znval2  14658  znbaslemnn  14659