chordthmlem4 - Metamath Proof Explorer

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

Theorem chordthmlem4 24362

Description: If P is on the segment AB and M is the midpoint of AB, then PA · PB = BM ² − PM ² . If all lengths are reexpressed as fractions of AB, this reduces to the identity 𝑋 · (1 − 𝑋) = (1 / 2) ² − ((1 / 2) − 𝑋) ² . (Contributed by David Moews, 28-Feb-2017.)

**Hypotheses**
Ref	Expression
chordthmlem4.A	⊢ (𝜑 → 𝐴 ∈ ℂ)
chordthmlem4.B	⊢ (𝜑 → 𝐵 ∈ ℂ)
chordthmlem4.X	⊢ (𝜑 → 𝑋 ∈ (0[,]1))
chordthmlem4.M	⊢ (𝜑 → 𝑀 = ((𝐴 + 𝐵) / 2))
chordthmlem4.P	⊢ (𝜑 → 𝑃 = ((𝑋 · 𝐴) + ((1 − 𝑋) · 𝐵)))

**Assertion**
Ref	Expression
chordthmlem4	⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = (((abs‘(𝐵 − 𝑀))↑2) − ((abs‘(𝑃 − 𝑀))↑2)))

**Proof of Theorem chordthmlem4**
Step	Hyp	Ref	Expression
1		1re 9918	. . . . . . . . 9 ⊢ 1 ∈ ℝ
2	1	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ)
3		unitssre 12190	. . . . . . . . 9 ⊢ (0[,]1) ⊆ ℝ
4		chordthmlem4.X	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ (0[,]1))
5	3, 4	sseldi 3566	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ ℝ)
6	2, 5	resubcld 10337	. . . . . . 7 ⊢ (𝜑 → (1 − 𝑋) ∈ ℝ)
7	6	recnd 9947	. . . . . 6 ⊢ (𝜑 → (1 − 𝑋) ∈ ℂ)
8	7	abscld 14023	. . . . 5 ⊢ (𝜑 → (abs‘(1 − 𝑋)) ∈ ℝ)
9	8	recnd 9947	. . . 4 ⊢ (𝜑 → (abs‘(1 − 𝑋)) ∈ ℂ)
10		chordthmlem4.B	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
11		chordthmlem4.A	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ)
12	10, 11	subcld 10271	. . . . . 6 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℂ)
13	12	abscld 14023	. . . . 5 ⊢ (𝜑 → (abs‘(𝐵 − 𝐴)) ∈ ℝ)
14	13	recnd 9947	. . . 4 ⊢ (𝜑 → (abs‘(𝐵 − 𝐴)) ∈ ℂ)
15	5	recnd 9947	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ ℂ)
16	15	abscld 14023	. . . . 5 ⊢ (𝜑 → (abs‘𝑋) ∈ ℝ)
17	16	recnd 9947	. . . 4 ⊢ (𝜑 → (abs‘𝑋) ∈ ℂ)
18	9, 14, 17, 14	mul4d 10127	. . 3 ⊢ (𝜑 → (((abs‘(1 − 𝑋)) · (abs‘(𝐵 − 𝐴))) · ((abs‘𝑋) · (abs‘(𝐵 − 𝐴)))) = (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴)) · (abs‘(𝐵 − 𝐴)))))
19		chordthmlem4.P	. . . . . . 7 ⊢ (𝜑 → 𝑃 = ((𝑋 · 𝐴) + ((1 − 𝑋) · 𝐵)))
20	15, 11	mulcld 9939	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 · 𝐴) ∈ ℂ)
21	7, 10	mulcld 9939	. . . . . . . . . 10 ⊢ (𝜑 → ((1 − 𝑋) · 𝐵) ∈ ℂ)
22	20, 21	addcld 9938	. . . . . . . . 9 ⊢ (𝜑 → ((𝑋 · 𝐴) + ((1 − 𝑋) · 𝐵)) ∈ ℂ)
23	19, 22	eqeltrd 2688	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℂ)
24	11, 23, 10, 15	affineequiv2 24354	. . . . . . 7 ⊢ (𝜑 → (𝑃 = ((𝑋 · 𝐴) + ((1 − 𝑋) · 𝐵)) ↔ (𝑃 − 𝐴) = ((1 − 𝑋) · (𝐵 − 𝐴))))
25	19, 24	mpbid 221	. . . . . 6 ⊢ (𝜑 → (𝑃 − 𝐴) = ((1 − 𝑋) · (𝐵 − 𝐴)))
26	25	fveq2d 6107	. . . . 5 ⊢ (𝜑 → (abs‘(𝑃 − 𝐴)) = (abs‘((1 − 𝑋) · (𝐵 − 𝐴))))
27	7, 12	absmuld 14041	. . . . 5 ⊢ (𝜑 → (abs‘((1 − 𝑋) · (𝐵 − 𝐴))) = ((abs‘(1 − 𝑋)) · (abs‘(𝐵 − 𝐴))))
28	26, 27	eqtrd 2644	. . . 4 ⊢ (𝜑 → (abs‘(𝑃 − 𝐴)) = ((abs‘(1 − 𝑋)) · (abs‘(𝐵 − 𝐴))))
29	23, 10	abssubd 14040	. . . . 5 ⊢ (𝜑 → (abs‘(𝑃 − 𝐵)) = (abs‘(𝐵 − 𝑃)))
30	11, 23, 10, 15	affineequiv 24353	. . . . . . 7 ⊢ (𝜑 → (𝑃 = ((𝑋 · 𝐴) + ((1 − 𝑋) · 𝐵)) ↔ (𝐵 − 𝑃) = (𝑋 · (𝐵 − 𝐴))))
31	19, 30	mpbid 221	. . . . . 6 ⊢ (𝜑 → (𝐵 − 𝑃) = (𝑋 · (𝐵 − 𝐴)))
32	31	fveq2d 6107	. . . . 5 ⊢ (𝜑 → (abs‘(𝐵 − 𝑃)) = (abs‘(𝑋 · (𝐵 − 𝐴))))
33	15, 12	absmuld 14041	. . . . 5 ⊢ (𝜑 → (abs‘(𝑋 · (𝐵 − 𝐴))) = ((abs‘𝑋) · (abs‘(𝐵 − 𝐴))))
34	29, 32, 33	3eqtrd 2648	. . . 4 ⊢ (𝜑 → (abs‘(𝑃 − 𝐵)) = ((abs‘𝑋) · (abs‘(𝐵 − 𝐴))))
35	28, 34	oveq12d 6567	. . 3 ⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = (((abs‘(1 − 𝑋)) · (abs‘(𝐵 − 𝐴))) · ((abs‘𝑋) · (abs‘(𝐵 − 𝐴)))))
36	14	sqvald 12867	. . . 4 ⊢ (𝜑 → ((abs‘(𝐵 − 𝐴))↑2) = ((abs‘(𝐵 − 𝐴)) · (abs‘(𝐵 − 𝐴))))
37	36	oveq2d 6565	. . 3 ⊢ (𝜑 → (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴))↑2)) = (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴)) · (abs‘(𝐵 − 𝐴)))))
38	18, 35, 37	3eqtr4d 2654	. 2 ⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴))↑2)))
39	2	recnd 9947	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ)
40	39	halfcld 11154	. . . . 5 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
41	40	sqcld 12868	. . . 4 ⊢ (𝜑 → ((1 / 2)↑2) ∈ ℂ)
42	2	rehalfcld 11156	. . . . . . . . 9 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
43	42, 5	resubcld 10337	. . . . . . . 8 ⊢ (𝜑 → ((1 / 2) − 𝑋) ∈ ℝ)
44	43	recnd 9947	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) − 𝑋) ∈ ℂ)
45	44	abscld 14023	. . . . . 6 ⊢ (𝜑 → (abs‘((1 / 2) − 𝑋)) ∈ ℝ)
46	45	recnd 9947	. . . . 5 ⊢ (𝜑 → (abs‘((1 / 2) − 𝑋)) ∈ ℂ)
47	46	sqcld 12868	. . . 4 ⊢ (𝜑 → ((abs‘((1 / 2) − 𝑋))↑2) ∈ ℂ)
48	14	sqcld 12868	. . . 4 ⊢ (𝜑 → ((abs‘(𝐵 − 𝐴))↑2) ∈ ℂ)
49	41, 47, 48	subdird 10366	. . 3 ⊢ (𝜑 → ((((1 / 2)↑2) − ((abs‘((1 / 2) − 𝑋))↑2)) · ((abs‘(𝐵 − 𝐴))↑2)) = ((((1 / 2)↑2) · ((abs‘(𝐵 − 𝐴))↑2)) − (((abs‘((1 / 2) − 𝑋))↑2) · ((abs‘(𝐵 − 𝐴))↑2))))
50		subsq 12834	. . . . . . 7 ⊢ (((1 / 2) ∈ ℂ ∧ ((1 / 2) − 𝑋) ∈ ℂ) → (((1 / 2)↑2) − (((1 / 2) − 𝑋)↑2)) = (((1 / 2) + ((1 / 2) − 𝑋)) · ((1 / 2) − ((1 / 2) − 𝑋))))
51	40, 44, 50	syl2anc 691	. . . . . 6 ⊢ (𝜑 → (((1 / 2)↑2) − (((1 / 2) − 𝑋)↑2)) = (((1 / 2) + ((1 / 2) − 𝑋)) · ((1 / 2) − ((1 / 2) − 𝑋))))
52	40, 40, 15	addsubassd 10291	. . . . . . . 8 ⊢ (𝜑 → (((1 / 2) + (1 / 2)) − 𝑋) = ((1 / 2) + ((1 / 2) − 𝑋)))
53	39	2halvesd 11155	. . . . . . . . 9 ⊢ (𝜑 → ((1 / 2) + (1 / 2)) = 1)
54	53	oveq1d 6564	. . . . . . . 8 ⊢ (𝜑 → (((1 / 2) + (1 / 2)) − 𝑋) = (1 − 𝑋))
55	52, 54	eqtr3d 2646	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) + ((1 / 2) − 𝑋)) = (1 − 𝑋))
56	40, 15	nncand 10276	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) − ((1 / 2) − 𝑋)) = 𝑋)
57	55, 56	oveq12d 6567	. . . . . 6 ⊢ (𝜑 → (((1 / 2) + ((1 / 2) − 𝑋)) · ((1 / 2) − ((1 / 2) − 𝑋))) = ((1 − 𝑋) · 𝑋))
58	51, 57	eqtr2d 2645	. . . . 5 ⊢ (𝜑 → ((1 − 𝑋) · 𝑋) = (((1 / 2)↑2) − (((1 / 2) − 𝑋)↑2)))
59		0re 9919	. . . . . . . . . 10 ⊢ 0 ∈ ℝ
60	59, 1	elicc2i 12110	. . . . . . . . 9 ⊢ (𝑋 ∈ (0[,]1) ↔ (𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ 1))
61	4, 60	sylib 207	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ 1))
62	61	simp3d 1068	. . . . . . 7 ⊢ (𝜑 → 𝑋 ≤ 1)
63	5, 2, 62	abssubge0d 14018	. . . . . 6 ⊢ (𝜑 → (abs‘(1 − 𝑋)) = (1 − 𝑋))
64	61	simp2d 1067	. . . . . . 7 ⊢ (𝜑 → 0 ≤ 𝑋)
65	5, 64	absidd 14009	. . . . . 6 ⊢ (𝜑 → (abs‘𝑋) = 𝑋)
66	63, 65	oveq12d 6567	. . . . 5 ⊢ (𝜑 → ((abs‘(1 − 𝑋)) · (abs‘𝑋)) = ((1 − 𝑋) · 𝑋))
67		absresq 13890	. . . . . . 7 ⊢ (((1 / 2) − 𝑋) ∈ ℝ → ((abs‘((1 / 2) − 𝑋))↑2) = (((1 / 2) − 𝑋)↑2))
68	43, 67	syl 17	. . . . . 6 ⊢ (𝜑 → ((abs‘((1 / 2) − 𝑋))↑2) = (((1 / 2) − 𝑋)↑2))
69	68	oveq2d 6565	. . . . 5 ⊢ (𝜑 → (((1 / 2)↑2) − ((abs‘((1 / 2) − 𝑋))↑2)) = (((1 / 2)↑2) − (((1 / 2) − 𝑋)↑2)))
70	58, 66, 69	3eqtr4d 2654	. . . 4 ⊢ (𝜑 → ((abs‘(1 − 𝑋)) · (abs‘𝑋)) = (((1 / 2)↑2) − ((abs‘((1 / 2) − 𝑋))↑2)))
71	70	oveq1d 6564	. . 3 ⊢ (𝜑 → (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴))↑2)) = ((((1 / 2)↑2) − ((abs‘((1 / 2) − 𝑋))↑2)) · ((abs‘(𝐵 − 𝐴))↑2)))
72		2cnd 10970	. . . . . . . . . . . . 13 ⊢ (𝜑 → 2 ∈ ℂ)
73		2ne0 10990	. . . . . . . . . . . . . 14 ⊢ 2 ≠ 0
74	73	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 2 ≠ 0)
75	10, 72, 74	divcan4d 10686	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐵 · 2) / 2) = 𝐵)
76	10	times2d 11153	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐵 · 2) = (𝐵 + 𝐵))
77	76	oveq1d 6564	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐵 · 2) / 2) = ((𝐵 + 𝐵) / 2))
78	75, 77	eqtr3d 2646	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = ((𝐵 + 𝐵) / 2))
79		chordthmlem4.M	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 = ((𝐴 + 𝐵) / 2))
80	78, 79	oveq12d 6567	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 − 𝑀) = (((𝐵 + 𝐵) / 2) − ((𝐴 + 𝐵) / 2)))
81	10, 10	addcld 9938	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 + 𝐵) ∈ ℂ)
82	11, 10	addcld 9938	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℂ)
83	81, 82, 72, 74	divsubdird 10719	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐵 + 𝐵) − (𝐴 + 𝐵)) / 2) = (((𝐵 + 𝐵) / 2) − ((𝐴 + 𝐵) / 2)))
84	10, 11, 10	pnpcan2d 10309	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐵 + 𝐵) − (𝐴 + 𝐵)) = (𝐵 − 𝐴))
85	84	oveq1d 6564	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐵 + 𝐵) − (𝐴 + 𝐵)) / 2) = ((𝐵 − 𝐴) / 2))
86	80, 83, 85	3eqtr2d 2650	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 − 𝑀) = ((𝐵 − 𝐴) / 2))
87	12, 72, 74	divrec2d 10684	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴) / 2) = ((1 / 2) · (𝐵 − 𝐴)))
88	86, 87	eqtrd 2644	. . . . . . . 8 ⊢ (𝜑 → (𝐵 − 𝑀) = ((1 / 2) · (𝐵 − 𝐴)))
89	88	fveq2d 6107	. . . . . . 7 ⊢ (𝜑 → (abs‘(𝐵 − 𝑀)) = (abs‘((1 / 2) · (𝐵 − 𝐴))))
90	40, 12	absmuld 14041	. . . . . . 7 ⊢ (𝜑 → (abs‘((1 / 2) · (𝐵 − 𝐴))) = ((abs‘(1 / 2)) · (abs‘(𝐵 − 𝐴))))
91	59	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℝ)
92		halfgt0 11125	. . . . . . . . . . 11 ⊢ 0 < (1 / 2)
93	92	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 0 < (1 / 2))
94	91, 42, 93	ltled 10064	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (1 / 2))
95	42, 94	absidd 14009	. . . . . . . 8 ⊢ (𝜑 → (abs‘(1 / 2)) = (1 / 2))
96	95	oveq1d 6564	. . . . . . 7 ⊢ (𝜑 → ((abs‘(1 / 2)) · (abs‘(𝐵 − 𝐴))) = ((1 / 2) · (abs‘(𝐵 − 𝐴))))
97	89, 90, 96	3eqtrd 2648	. . . . . 6 ⊢ (𝜑 → (abs‘(𝐵 − 𝑀)) = ((1 / 2) · (abs‘(𝐵 − 𝐴))))
98	97	oveq1d 6564	. . . . 5 ⊢ (𝜑 → ((abs‘(𝐵 − 𝑀))↑2) = (((1 / 2) · (abs‘(𝐵 − 𝐴)))↑2))
99	40, 14	sqmuld 12882	. . . . 5 ⊢ (𝜑 → (((1 / 2) · (abs‘(𝐵 − 𝐴)))↑2) = (((1 / 2)↑2) · ((abs‘(𝐵 − 𝐴))↑2)))
100	98, 99	eqtrd 2644	. . . 4 ⊢ (𝜑 → ((abs‘(𝐵 − 𝑀))↑2) = (((1 / 2)↑2) · ((abs‘(𝐵 − 𝐴))↑2)))
101	40, 15, 12	subdird 10366	. . . . . . . . 9 ⊢ (𝜑 → (((1 / 2) − 𝑋) · (𝐵 − 𝐴)) = (((1 / 2) · (𝐵 − 𝐴)) − (𝑋 · (𝐵 − 𝐴))))
102	88, 31	oveq12d 6567	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝑀) − (𝐵 − 𝑃)) = (((1 / 2) · (𝐵 − 𝐴)) − (𝑋 · (𝐵 − 𝐴))))
103	82	halfcld 11154	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴 + 𝐵) / 2) ∈ ℂ)
104	79, 103	eqeltrd 2688	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℂ)
105	10, 104, 23	nnncan1d 10305	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝑀) − (𝐵 − 𝑃)) = (𝑃 − 𝑀))
106	101, 102, 105	3eqtr2rd 2651	. . . . . . . 8 ⊢ (𝜑 → (𝑃 − 𝑀) = (((1 / 2) − 𝑋) · (𝐵 − 𝐴)))
107	106	fveq2d 6107	. . . . . . 7 ⊢ (𝜑 → (abs‘(𝑃 − 𝑀)) = (abs‘(((1 / 2) − 𝑋) · (𝐵 − 𝐴))))
108	44, 12	absmuld 14041	. . . . . . 7 ⊢ (𝜑 → (abs‘(((1 / 2) − 𝑋) · (𝐵 − 𝐴))) = ((abs‘((1 / 2) − 𝑋)) · (abs‘(𝐵 − 𝐴))))
109	107, 108	eqtrd 2644	. . . . . 6 ⊢ (𝜑 → (abs‘(𝑃 − 𝑀)) = ((abs‘((1 / 2) − 𝑋)) · (abs‘(𝐵 − 𝐴))))
110	109	oveq1d 6564	. . . . 5 ⊢ (𝜑 → ((abs‘(𝑃 − 𝑀))↑2) = (((abs‘((1 / 2) − 𝑋)) · (abs‘(𝐵 − 𝐴)))↑2))
111	46, 14	sqmuld 12882	. . . . 5 ⊢ (𝜑 → (((abs‘((1 / 2) − 𝑋)) · (abs‘(𝐵 − 𝐴)))↑2) = (((abs‘((1 / 2) − 𝑋))↑2) · ((abs‘(𝐵 − 𝐴))↑2)))
112	110, 111	eqtrd 2644	. . . 4 ⊢ (𝜑 → ((abs‘(𝑃 − 𝑀))↑2) = (((abs‘((1 / 2) − 𝑋))↑2) · ((abs‘(𝐵 − 𝐴))↑2)))
113	100, 112	oveq12d 6567	. . 3 ⊢ (𝜑 → (((abs‘(𝐵 − 𝑀))↑2) − ((abs‘(𝑃 − 𝑀))↑2)) = ((((1 / 2)↑2) · ((abs‘(𝐵 − 𝐴))↑2)) − (((abs‘((1 / 2) − 𝑋))↑2) · ((abs‘(𝐵 − 𝐴))↑2))))
114	49, 71, 113	3eqtr4rd 2655	. 2 ⊢ (𝜑 → (((abs‘(𝐵 − 𝑀))↑2) − ((abs‘(𝑃 − 𝑀))↑2)) = (((abs‘(1 − 𝑋)) · (abs‘𝑋)) · ((abs‘(𝐵 − 𝐴))↑2)))
115	38, 114	eqtr4d 2647	1 ⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = (((abs‘(𝐵 − 𝑀))↑2) − ((abs‘(𝑃 − 𝑀))↑2)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 2c2 10947 [,]cicc 12049 ↑cexp 12722 abscabs 13822

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-icc 12053 df-seq 12664 df-exp 12723 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824

This theorem is referenced by: chordthmlem5 24363

W3C validator