divalglem8 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > divalglem8		Structured version Visualization version GIF version

Theorem divalglem8 16458

Description: Lemma for divalg 16461. (Contributed by Paul Chapman, 21-Mar-2011.)

**Hypotheses**
Ref	Expression
divalglem8.1	⊢ 𝑁 ∈ ℤ
divalglem8.2	⊢ 𝐷 ∈ ℤ
divalglem8.3	⊢ 𝐷 ≠ 0
divalglem8.4	⊢ 𝑆 = {𝑟 ∈ ℕ₀ ∣ 𝐷 ∥ (𝑁 − 𝑟)}

**Assertion**
Ref	Expression
divalglem8	⊢ (((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) ∧ (𝑋 < (abs‘𝐷) ∧ 𝑌 < (abs‘𝐷))) → (𝐾 ∈ ℤ → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌)))

Distinct variable groups: 𝐷,𝑟 𝑁,𝑟 Allowed substitution hints: 𝑆(𝑟) 𝐾(𝑟) 𝑋(𝑟) 𝑌(𝑟)

Proof of Theorem divalglem8 Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		divalglem8.4	. . . . . . . . . . . . 13 ⊢ 𝑆 = {𝑟 ∈ ℕ₀ ∣ 𝐷 ∥ (𝑁 − 𝑟)}
2	1	ssrab3 4042	. . . . . . . . . . . 12 ⊢ 𝑆 ⊆ ℕ₀
3		nn0sscn 12509	. . . . . . . . . . . 12 ⊢ ℕ₀ ⊆ ℂ
4	2, 3	sstri 3952	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ ℂ
5	4	sseli 3939	. . . . . . . . . 10 ⊢ (𝑌 ∈ 𝑆 → 𝑌 ∈ ℂ)
6	4	sseli 3939	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ ℂ)
7		divalglem8.2	. . . . . . . . . . . . . 14 ⊢ 𝐷 ∈ ℤ
8		divalglem8.3	. . . . . . . . . . . . . 14 ⊢ 𝐷 ≠ 0
9		nnabscl 15377	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ)
10	7, 8, 9	mp2an 704	. . . . . . . . . . . . 13 ⊢ (abs‘𝐷) ∈ ℕ
11	10	nnzi 12618	. . . . . . . . . . . 12 ⊢ (abs‘𝐷) ∈ ℤ
12		zmulcl 12643	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ ℤ ∧ (abs‘𝐷) ∈ ℤ) → (𝐾 · (abs‘𝐷)) ∈ ℤ)
13	11, 12	mpan2 703	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (𝐾 · (abs‘𝐷)) ∈ ℤ)
14	13	zcnd 12701	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → (𝐾 · (abs‘𝐷)) ∈ ℂ)
15		subadd 11460	. . . . . . . . . 10 ⊢ ((𝑌 ∈ ℂ ∧ 𝑋 ∈ ℂ ∧ (𝐾 · (abs‘𝐷)) ∈ ℂ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
16	5, 6, 14, 15	syl3an 1176	. . . . . . . . 9 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
17	16	3com12 1139	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
18		eqcom 2776	. . . . . . . 8 ⊢ ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋))
19		eqcom 2776	. . . . . . . 8 ⊢ ((𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌 ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))))
20	17, 18, 19	3bitr3g 316	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
21	20	3adant1r 1194	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
22	21	3adant2r 1196	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
23		breq1 5114	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑌 → (𝑧 < (abs‘𝐷) ↔ 𝑌 < (abs‘𝐷)))
24		eleq1 2857	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑌 → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ 𝑌 ∈ (0...((abs‘𝐷) − 1))))
25	23, 24	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑌 → ((𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))) ↔ (𝑌 < (abs‘𝐷) → 𝑌 ∈ (0...((abs‘𝐷) − 1)))))
26	2	sseli 3939	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ℕ₀)
27		elnn0z 12604	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ ℕ₀ ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧))
28	26, 27	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧))
29	28	anim1i 626	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧) ∧ 𝑧 < (abs‘𝐷)))
30		df-3an 1103	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)) ↔ ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧) ∧ 𝑧 < (abs‘𝐷)))
31	29, 30	sylibr 237	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)))
32		0z 12602	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℤ
33		elfzm11 13623	. . . . . . . . . . . . . 14 ⊢ ((0 ∈ ℤ ∧ (abs‘𝐷) ∈ ℤ) → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷))))
34	32, 11, 33	mp2an 704	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)))
35	31, 34	sylibr 237	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → 𝑧 ∈ (0...((abs‘𝐷) − 1)))
36	35	ex 417	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑆 → (𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))))
37	25, 36	vtoclga 3548	. . . . . . . . . 10 ⊢ (𝑌 ∈ 𝑆 → (𝑌 < (abs‘𝐷) → 𝑌 ∈ (0...((abs‘𝐷) − 1))))
38		eleq1 2857	. . . . . . . . . . 11 ⊢ (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑌 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
39	38	biimpd 232	. . . . . . . . . 10 ⊢ (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑌 ∈ (0...((abs‘𝐷) − 1)) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
40	37, 39	sylan9 516	. . . . . . . . 9 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))) → (𝑌 < (abs‘𝐷) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
41	40	impancom 456	. . . . . . . 8 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
42	41	3ad2ant2 1150	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
43		breq1 5114	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑋 → (𝑧 < (abs‘𝐷) ↔ 𝑋 < (abs‘𝐷)))
44		eleq1 2857	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑋 → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ 𝑋 ∈ (0...((abs‘𝐷) − 1))))
45	43, 44	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑋 → ((𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))) ↔ (𝑋 < (abs‘𝐷) → 𝑋 ∈ (0...((abs‘𝐷) − 1)))))
46	45, 36	vtoclga 3548	. . . . . . . . . . 11 ⊢ (𝑋 ∈ 𝑆 → (𝑋 < (abs‘𝐷) → 𝑋 ∈ (0...((abs‘𝐷) − 1))))
47	46	imp 411	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) → 𝑋 ∈ (0...((abs‘𝐷) − 1)))
48	7, 8	divalglem7 16457	. . . . . . . . . 10 ⊢ ((𝑋 ∈ (0...((abs‘𝐷) − 1)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
49	47, 48	sylan 591	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
50	49	3adant2 1147	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
51	50	con2d 135	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1)) → ¬ 𝐾 ≠ 0))
52	42, 51	syld 48	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → ¬ 𝐾 ≠ 0))
53		df-ne 2965	. . . . . . 7 ⊢ (𝐾 ≠ 0 ↔ ¬ 𝐾 = 0)
54	53	con2bii 360	. . . . . 6 ⊢ (𝐾 = 0 ↔ ¬ 𝐾 ≠ 0)
55	52, 54	imbitrrdi 255	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → 𝐾 = 0))
56	22, 55	sylbid 243	. . . 4 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝐾 = 0))
57		oveq1 7418	. . . . . . . . . . 11 ⊢ (𝐾 = 0 → (𝐾 · (abs‘𝐷)) = (0 · (abs‘𝐷)))
58	10	nncni 12243	. . . . . . . . . . . 12 ⊢ (abs‘𝐷) ∈ ℂ
59	58	mul02i 11399	. . . . . . . . . . 11 ⊢ (0 · (abs‘𝐷)) = 0
60	57, 59	eqtrdi 2820	. . . . . . . . . 10 ⊢ (𝐾 = 0 → (𝐾 · (abs‘𝐷)) = 0)
61	60	eqeq1d 2771	. . . . . . . . 9 ⊢ (𝐾 = 0 → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 0 = (𝑌 − 𝑋)))
62	61	biimpac 483	. . . . . . . 8 ⊢ (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 0 = (𝑌 − 𝑋))
63		subeq0 11484	. . . . . . . . . 10 ⊢ ((𝑌 ∈ ℂ ∧ 𝑋 ∈ ℂ) → ((𝑌 − 𝑋) = 0 ↔ 𝑌 = 𝑋))
64	5, 6, 63	syl2anr 608	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑌 − 𝑋) = 0 ↔ 𝑌 = 𝑋))
65		eqcom 2776	. . . . . . . . 9 ⊢ ((𝑌 − 𝑋) = 0 ↔ 0 = (𝑌 − 𝑋))
66		eqcom 2776	. . . . . . . . 9 ⊢ (𝑌 = 𝑋 ↔ 𝑋 = 𝑌)
67	64, 65, 66	3bitr3g 316	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (0 = (𝑌 − 𝑋) ↔ 𝑋 = 𝑌))
68	62, 67	imbitrid 247	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
69	68	ad2ant2r 759	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷))) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
70	69	3adant3 1148	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
71	70	expd 420	. . . 4 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → (𝐾 = 0 → 𝑋 = 𝑌)))
72	56, 71	mpdd 44	. . 3 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌))
73	72	3expia 1137	. 2 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷))) → (𝐾 ∈ ℤ → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌)))
74	73	an4s 672	1 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) ∧ (𝑋 < (abs‘𝐷) ∧ 𝑌 < (abs‘𝐷))) → (𝐾 ∈ ℤ → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 {crab 3422 class class class wbr 5111 ‘cfv 6537 (class class class)co 7411 ℂcc 11098 0cc0 11100 1c1 11101 + caddc 11103 · cmul 11105 < clt 11243 ≤ cle 11244 − cmin 11441 ℕcn 12233 ℕ₀cn0 12504 ℤcz 12591 ...cfz 13535 abscabs 15285 ∥ cdvds 16310

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-sup 9402 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-z 12592 df-uz 12863 df-rp 13017 df-fz 13536 df-seq 14038 df-exp 14098 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287

This theorem is referenced by: divalglem9 16459

W3C validator