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 16364

Description: Lemma for divalg 16367. (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 4023	. . . . . . . . . . . 12 ⊢ 𝑆 ⊆ ℕ₀
3		nn0sscn 12437	. . . . . . . . . . . 12 ⊢ ℕ₀ ⊆ ℂ
4	2, 3	sstri 3932	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ ℂ
5	4	sseli 3918	. . . . . . . . . 10 ⊢ (𝑌 ∈ 𝑆 → 𝑌 ∈ ℂ)
6	4	sseli 3918	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ ℂ)
7		divalglem8.2	. . . . . . . . . . . . . 14 ⊢ 𝐷 ∈ ℤ
8		divalglem8.3	. . . . . . . . . . . . . 14 ⊢ 𝐷 ≠ 0
9		nnabscl 15283	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ)
10	7, 8, 9	mp2an 693	. . . . . . . . . . . . 13 ⊢ (abs‘𝐷) ∈ ℕ
11	10	nnzi 12546	. . . . . . . . . . . 12 ⊢ (abs‘𝐷) ∈ ℤ
12		zmulcl 12571	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ ℤ ∧ (abs‘𝐷) ∈ ℤ) → (𝐾 · (abs‘𝐷)) ∈ ℤ)
13	11, 12	mpan2 692	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (𝐾 · (abs‘𝐷)) ∈ ℤ)
14	13	zcnd 12629	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → (𝐾 · (abs‘𝐷)) ∈ ℂ)
15		subadd 11391	. . . . . . . . . 10 ⊢ ((𝑌 ∈ ℂ ∧ 𝑋 ∈ ℂ ∧ (𝐾 · (abs‘𝐷)) ∈ ℂ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
16	5, 6, 14, 15	syl3an 1161	. . . . . . . . 9 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
17	16	3com12 1124	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌))
18		eqcom 2744	. . . . . . . 8 ⊢ ((𝑌 − 𝑋) = (𝐾 · (abs‘𝐷)) ↔ (𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋))
19		eqcom 2744	. . . . . . . 8 ⊢ ((𝑋 + (𝐾 · (abs‘𝐷))) = 𝑌 ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))))
20	17, 18, 19	3bitr3g 313	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
21	20	3adant1r 1179	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ 𝑌 ∈ 𝑆 ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
22	21	3adant2r 1181	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))))
23		breq1 5089	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑌 → (𝑧 < (abs‘𝐷) ↔ 𝑌 < (abs‘𝐷)))
24		eleq1 2825	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑌 → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ 𝑌 ∈ (0...((abs‘𝐷) − 1))))
25	23, 24	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑌 → ((𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))) ↔ (𝑌 < (abs‘𝐷) → 𝑌 ∈ (0...((abs‘𝐷) − 1)))))
26	2	sseli 3918	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ℕ₀)
27		elnn0z 12532	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ ℕ₀ ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧))
28	26, 27	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧))
29	28	anim1i 616	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧) ∧ 𝑧 < (abs‘𝐷)))
30		df-3an 1089	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)) ↔ ((𝑧 ∈ ℤ ∧ 0 ≤ 𝑧) ∧ 𝑧 < (abs‘𝐷)))
31	29, 30	sylibr 234	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)))
32		0z 12530	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℤ
33		elfzm11 13544	. . . . . . . . . . . . . 14 ⊢ ((0 ∈ ℤ ∧ (abs‘𝐷) ∈ ℤ) → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷))))
34	32, 11, 33	mp2an 693	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑧 ∈ ℤ ∧ 0 ≤ 𝑧 ∧ 𝑧 < (abs‘𝐷)))
35	31, 34	sylibr 234	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑧 < (abs‘𝐷)) → 𝑧 ∈ (0...((abs‘𝐷) − 1)))
36	35	ex 412	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑆 → (𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))))
37	25, 36	vtoclga 3521	. . . . . . . . . 10 ⊢ (𝑌 ∈ 𝑆 → (𝑌 < (abs‘𝐷) → 𝑌 ∈ (0...((abs‘𝐷) − 1))))
38		eleq1 2825	. . . . . . . . . . 11 ⊢ (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑌 ∈ (0...((abs‘𝐷) − 1)) ↔ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
39	38	biimpd 229	. . . . . . . . . 10 ⊢ (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑌 ∈ (0...((abs‘𝐷) − 1)) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
40	37, 39	sylan9 507	. . . . . . . . 9 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑌 = (𝑋 + (𝐾 · (abs‘𝐷)))) → (𝑌 < (abs‘𝐷) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
41	40	impancom 451	. . . . . . . 8 ⊢ ((𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
42	41	3ad2ant2 1135	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
43		breq1 5089	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑋 → (𝑧 < (abs‘𝐷) ↔ 𝑋 < (abs‘𝐷)))
44		eleq1 2825	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑋 → (𝑧 ∈ (0...((abs‘𝐷) − 1)) ↔ 𝑋 ∈ (0...((abs‘𝐷) − 1))))
45	43, 44	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑋 → ((𝑧 < (abs‘𝐷) → 𝑧 ∈ (0...((abs‘𝐷) − 1))) ↔ (𝑋 < (abs‘𝐷) → 𝑋 ∈ (0...((abs‘𝐷) − 1)))))
46	45, 36	vtoclga 3521	. . . . . . . . . . 11 ⊢ (𝑋 ∈ 𝑆 → (𝑋 < (abs‘𝐷) → 𝑋 ∈ (0...((abs‘𝐷) − 1))))
47	46	imp 406	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) → 𝑋 ∈ (0...((abs‘𝐷) − 1)))
48	7, 8	divalglem7 16363	. . . . . . . . . 10 ⊢ ((𝑋 ∈ (0...((abs‘𝐷) − 1)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
49	47, 48	sylan 581	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
50	49	3adant2 1132	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝐾 ≠ 0 → ¬ (𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1))))
51	50	con2d 134	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝑋 + (𝐾 · (abs‘𝐷))) ∈ (0...((abs‘𝐷) − 1)) → ¬ 𝐾 ≠ 0))
52	42, 51	syld 47	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → ¬ 𝐾 ≠ 0))
53		df-ne 2934	. . . . . . 7 ⊢ (𝐾 ≠ 0 ↔ ¬ 𝐾 = 0)
54	53	con2bii 357	. . . . . 6 ⊢ (𝐾 = 0 ↔ ¬ 𝐾 ≠ 0)
55	52, 54	imbitrrdi 252	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (𝑌 = (𝑋 + (𝐾 · (abs‘𝐷))) → 𝐾 = 0))
56	22, 55	sylbid 240	. . . 4 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝐾 = 0))
57		oveq1 7369	. . . . . . . . . . 11 ⊢ (𝐾 = 0 → (𝐾 · (abs‘𝐷)) = (0 · (abs‘𝐷)))
58	10	nncni 12179	. . . . . . . . . . . 12 ⊢ (abs‘𝐷) ∈ ℂ
59	58	mul02i 11330	. . . . . . . . . . 11 ⊢ (0 · (abs‘𝐷)) = 0
60	57, 59	eqtrdi 2788	. . . . . . . . . 10 ⊢ (𝐾 = 0 → (𝐾 · (abs‘𝐷)) = 0)
61	60	eqeq1d 2739	. . . . . . . . 9 ⊢ (𝐾 = 0 → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ↔ 0 = (𝑌 − 𝑋)))
62	61	biimpac 478	. . . . . . . 8 ⊢ (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 0 = (𝑌 − 𝑋))
63		subeq0 11415	. . . . . . . . . 10 ⊢ ((𝑌 ∈ ℂ ∧ 𝑋 ∈ ℂ) → ((𝑌 − 𝑋) = 0 ↔ 𝑌 = 𝑋))
64	5, 6, 63	syl2anr 598	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑌 − 𝑋) = 0 ↔ 𝑌 = 𝑋))
65		eqcom 2744	. . . . . . . . 9 ⊢ ((𝑌 − 𝑋) = 0 ↔ 0 = (𝑌 − 𝑋))
66		eqcom 2744	. . . . . . . . 9 ⊢ (𝑌 = 𝑋 ↔ 𝑋 = 𝑌)
67	64, 65, 66	3bitr3g 313	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (0 = (𝑌 − 𝑋) ↔ 𝑋 = 𝑌))
68	62, 67	imbitrid 244	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
69	68	ad2ant2r 748	. . . . . 6 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷))) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
70	69	3adant3 1133	. . . . 5 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → (((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) ∧ 𝐾 = 0) → 𝑋 = 𝑌))
71	70	expd 415	. . . 4 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → (𝐾 = 0 → 𝑋 = 𝑌)))
72	56, 71	mpdd 43	. . 3 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷)) ∧ 𝐾 ∈ ℤ) → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌))
73	72	3expia 1122	. 2 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑋 < (abs‘𝐷)) ∧ (𝑌 ∈ 𝑆 ∧ 𝑌 < (abs‘𝐷))) → (𝐾 ∈ ℤ → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌)))
74	73	an4s 661	1 ⊢ (((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) ∧ (𝑋 < (abs‘𝐷) ∧ 𝑌 < (abs‘𝐷))) → (𝐾 ∈ ℤ → ((𝐾 · (abs‘𝐷)) = (𝑌 − 𝑋) → 𝑋 = 𝑌)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 {crab 3390 class class class wbr 5086 ‘cfv 6494 (class class class)co 7362 ℂcc 11031 0cc0 11033 1c1 11034 + caddc 11036 · cmul 11038 < clt 11174 ≤ cle 11175 − cmin 11372 ℕcn 12169 ℕ₀cn0 12432 ℤcz 12519 ...cfz 13456 abscabs 15191 ∥ cdvds 16216

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 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-pre-sup 11111

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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-1st 7937 df-2nd 7938 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-sup 9350 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-div 11803 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-seq 13959 df-exp 14019 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193

This theorem is referenced by: divalglem9 16365

W3C validator