apdifflemf - Mathbox for Jim Kingdon

	Mathbox for Jim Kingdon		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > Mathboxes > apdifflemf		GIF version

Theorem apdifflemf 17262

Description: Lemma for apdiff 17264. Being apart from the point halfway between 𝑄 and 𝑅 suffices for 𝐴 to be a different distance from 𝑄 and from 𝑅. (Contributed by Jim Kingdon, 18-May-2024.)

**Hypotheses**
Ref	Expression
apdifflemf.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
apdifflemf.q	⊢ (𝜑 → 𝑄 ∈ ℚ)
apdifflemf.r	⊢ (𝜑 → 𝑅 ∈ ℚ)
apdifflemf.qr	⊢ (𝜑 → 𝑄 < 𝑅)
apdifflemf.ap	⊢ (𝜑 → ((𝑄 + 𝑅) / 2) # 𝐴)

**Assertion**
Ref	Expression
apdifflemf	⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) # (abs‘(𝐴 − 𝑅)))

**Proof of Theorem apdifflemf**
Step	Hyp	Ref	Expression
1		apdifflemf.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2	1	recnd 8355	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
3		apdifflemf.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ ℚ)
4		qcn 10044	. . . . . . 7 ⊢ (𝑅 ∈ ℚ → 𝑅 ∈ ℂ)
5	3, 4	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ ℂ)
6	2, 5	subcld 8639	. . . . 5 ⊢ (𝜑 → (𝐴 − 𝑅) ∈ ℂ)
7	6	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝐴 − 𝑅) ∈ ℂ)
8	7	abscld 11964	. . 3 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (abs‘(𝐴 − 𝑅)) ∈ ℝ)
9		apdifflemf.q	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ ℚ)
10		qcn 10044	. . . . . . 7 ⊢ (𝑄 ∈ ℚ → 𝑄 ∈ ℂ)
11	9, 10	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℂ)
12	2, 11	subcld 8639	. . . . 5 ⊢ (𝜑 → (𝐴 − 𝑄) ∈ ℂ)
13	12	abscld 11964	. . . 4 ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) ∈ ℝ)
14	13	adantr 276	. . 3 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (abs‘(𝐴 − 𝑄)) ∈ ℝ)
15		qre 10035	. . . . . . . . . 10 ⊢ (𝑄 ∈ ℚ → 𝑄 ∈ ℝ)
16	9, 15	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝑄 ∈ ℝ)
17	16	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 ∈ ℝ)
18	1	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝐴 ∈ ℝ)
19		qaddcl 10045	. . . . . . . . . . . . . 14 ⊢ ((𝑄 ∈ ℚ ∧ 𝑅 ∈ ℚ) → (𝑄 + 𝑅) ∈ ℚ)
20	9, 3, 19	syl2anc 415	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑄 + 𝑅) ∈ ℚ)
21		qre 10035	. . . . . . . . . . . . 13 ⊢ ((𝑄 + 𝑅) ∈ ℚ → (𝑄 + 𝑅) ∈ ℝ)
22	20, 21	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑄 + 𝑅) ∈ ℝ)
23	22	rehalfcld 9557	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑄 + 𝑅) / 2) ∈ ℝ)
24	23	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → ((𝑄 + 𝑅) / 2) ∈ ℝ)
25		apdifflemf.qr	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 < 𝑅)
26		qre 10035	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ ℚ → 𝑅 ∈ ℝ)
27	3, 26	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ℝ)
28		avglt1 9549	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (𝑄 < 𝑅 ↔ 𝑄 < ((𝑄 + 𝑅) / 2)))
29	16, 27, 28	syl2anc 415	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑄 < 𝑅 ↔ 𝑄 < ((𝑄 + 𝑅) / 2)))
30	25, 29	mpbid 147	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄 < ((𝑄 + 𝑅) / 2))
31	30	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 < ((𝑄 + 𝑅) / 2))
32		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → ((𝑄 + 𝑅) / 2) < 𝐴)
33	17, 24, 18, 31, 32	lttrd 8454	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 < 𝐴)
34	17, 18, 33	ltled 8447	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 ≤ 𝐴)
35	17, 18, 34	abssubge0d 11959	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (abs‘(𝐴 − 𝑄)) = (𝐴 − 𝑄))
36	35	oveq2d 6101	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 − (abs‘(𝐴 − 𝑄))) = (𝑅 − (𝐴 − 𝑄)))
37	5	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑅 ∈ ℂ)
38	2	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝐴 ∈ ℂ)
39	11	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 ∈ ℂ)
40	37, 38, 39	subsub3d 8669	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 − (𝐴 − 𝑄)) = ((𝑅 + 𝑄) − 𝐴))
41	37, 39	addcomd 8479	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 + 𝑄) = (𝑄 + 𝑅))
42	41	oveq1d 6100	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → ((𝑅 + 𝑄) − 𝐴) = ((𝑄 + 𝑅) − 𝐴))
43	36, 40, 42	3eqtrd 2275	. . . . 5 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 − (abs‘(𝐴 − 𝑄))) = ((𝑄 + 𝑅) − 𝐴))
44	22	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑄 + 𝑅) ∈ ℝ)
45		2rp 10070	. . . . . . . . . 10 ⊢ 2 ∈ ℝ⁺
46	45	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 2 ∈ ℝ⁺)
47	44, 18, 46	ltdivmuld 10160	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (((𝑄 + 𝑅) / 2) < 𝐴 ↔ (𝑄 + 𝑅) < (2 · 𝐴)))
48	32, 47	mpbid 147	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑄 + 𝑅) < (2 · 𝐴))
49	38	2timesd 9553	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (2 · 𝐴) = (𝐴 + 𝐴))
50	48, 49	breqtrd 4156	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑄 + 𝑅) < (𝐴 + 𝐴))
51	44, 18, 18	ltsubaddd 8871	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (((𝑄 + 𝑅) − 𝐴) < 𝐴 ↔ (𝑄 + 𝑅) < (𝐴 + 𝐴)))
52	50, 51	mpbird 167	. . . . 5 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → ((𝑄 + 𝑅) − 𝐴) < 𝐴)
53	43, 52	eqbrtrd 4152	. . . 4 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 − (abs‘(𝐴 − 𝑄))) < 𝐴)
54	25	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑄 < 𝑅)
55	27	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝑅 ∈ ℝ)
56		difrp 10104	. . . . . . . 8 ⊢ ((𝑄 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (𝑄 < 𝑅 ↔ (𝑅 − 𝑄) ∈ ℝ⁺))
57	17, 55, 56	syl2anc 415	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑄 < 𝑅 ↔ (𝑅 − 𝑄) ∈ ℝ⁺))
58	54, 57	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 − 𝑄) ∈ ℝ⁺)
59	18, 58	ltaddrpd 10142	. . . . 5 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝐴 < (𝐴 + (𝑅 − 𝑄)))
60	35	oveq2d 6101	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 + (abs‘(𝐴 − 𝑄))) = (𝑅 + (𝐴 − 𝑄)))
61	37, 38, 39	addsub12d 8662	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 + (𝐴 − 𝑄)) = (𝐴 + (𝑅 − 𝑄)))
62	60, 61	eqtrd 2271	. . . . 5 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (𝑅 + (abs‘(𝐴 − 𝑄))) = (𝐴 + (𝑅 − 𝑄)))
63	59, 62	breqtrrd 4158	. . . 4 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → 𝐴 < (𝑅 + (abs‘(𝐴 − 𝑄))))
64	18, 55, 14	absdifltd 11961	. . . 4 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → ((abs‘(𝐴 − 𝑅)) < (abs‘(𝐴 − 𝑄)) ↔ ((𝑅 − (abs‘(𝐴 − 𝑄))) < 𝐴 ∧ 𝐴 < (𝑅 + (abs‘(𝐴 − 𝑄))))))
65	53, 63, 64	mpbir2and 957	. . 3 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (abs‘(𝐴 − 𝑅)) < (abs‘(𝐴 − 𝑄)))
66	8, 14, 65	gtapd 8968	. 2 ⊢ ((𝜑 ∧ ((𝑄 + 𝑅) / 2) < 𝐴) → (abs‘(𝐴 − 𝑄)) # (abs‘(𝐴 − 𝑅)))
67	13	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑄)) ∈ ℝ)
68	6	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (𝐴 − 𝑅) ∈ ℂ)
69	68	abscld 11964	. . 3 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑅)) ∈ ℝ)
70	11, 5, 2	subsubd 8667	. . . . . . 7 ⊢ (𝜑 → (𝑄 − (𝑅 − 𝐴)) = ((𝑄 − 𝑅) + 𝐴))
71	16, 27	sublt0d 8901	. . . . . . . . 9 ⊢ (𝜑 → ((𝑄 − 𝑅) < 0 ↔ 𝑄 < 𝑅))
72	25, 71	mpbird 167	. . . . . . . 8 ⊢ (𝜑 → (𝑄 − 𝑅) < 0)
73	16, 27	resubcld 8710	. . . . . . . . 9 ⊢ (𝜑 → (𝑄 − 𝑅) ∈ ℝ)
74		ltaddnegr 8755	. . . . . . . . 9 ⊢ (((𝑄 − 𝑅) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝑄 − 𝑅) < 0 ↔ ((𝑄 − 𝑅) + 𝐴) < 𝐴))
75	73, 1, 74	syl2anc 415	. . . . . . . 8 ⊢ (𝜑 → ((𝑄 − 𝑅) < 0 ↔ ((𝑄 − 𝑅) + 𝐴) < 𝐴))
76	72, 75	mpbid 147	. . . . . . 7 ⊢ (𝜑 → ((𝑄 − 𝑅) + 𝐴) < 𝐴)
77	70, 76	eqbrtrd 4152	. . . . . 6 ⊢ (𝜑 → (𝑄 − (𝑅 − 𝐴)) < 𝐴)
78	77	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (𝑄 − (𝑅 − 𝐴)) < 𝐴)
79	1	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 ∈ ℝ)
80	22	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (𝑄 + 𝑅) ∈ ℝ)
81		simpr 110	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 < ((𝑄 + 𝑅) / 2))
82	79, 79, 80, 81, 81	lt2halvesd 9558	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (𝐴 + 𝐴) < (𝑄 + 𝑅))
83	79, 79, 80	ltaddsub2d 8876	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → ((𝐴 + 𝐴) < (𝑄 + 𝑅) ↔ 𝐴 < ((𝑄 + 𝑅) − 𝐴)))
84	82, 83	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 < ((𝑄 + 𝑅) − 𝐴))
85	11	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝑄 ∈ ℂ)
86	5	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝑅 ∈ ℂ)
87	2	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 ∈ ℂ)
88	85, 86, 87	addsubassd 8659	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → ((𝑄 + 𝑅) − 𝐴) = (𝑄 + (𝑅 − 𝐴)))
89	84, 88	breqtrd 4156	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 < (𝑄 + (𝑅 − 𝐴)))
90	16	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝑄 ∈ ℝ)
91	27	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝑅 ∈ ℝ)
92	91, 79	resubcld 8710	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (𝑅 − 𝐴) ∈ ℝ)
93	79, 90, 92	absdifltd 11961	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → ((abs‘(𝐴 − 𝑄)) < (𝑅 − 𝐴) ↔ ((𝑄 − (𝑅 − 𝐴)) < 𝐴 ∧ 𝐴 < (𝑄 + (𝑅 − 𝐴)))))
94	78, 89, 93	mpbir2and 957	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑄)) < (𝑅 − 𝐴))
95	23	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → ((𝑄 + 𝑅) / 2) ∈ ℝ)
96		avglt2 9550	. . . . . . . . . 10 ⊢ ((𝑄 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (𝑄 < 𝑅 ↔ ((𝑄 + 𝑅) / 2) < 𝑅))
97	16, 27, 96	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑄 < 𝑅 ↔ ((𝑄 + 𝑅) / 2) < 𝑅))
98	25, 97	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → ((𝑄 + 𝑅) / 2) < 𝑅)
99	98	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → ((𝑄 + 𝑅) / 2) < 𝑅)
100	79, 95, 91, 81, 99	lttrd 8454	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 < 𝑅)
101	79, 91, 100	ltled 8447	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → 𝐴 ≤ 𝑅)
102	79, 91, 101	abssuble0d 11960	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑅)) = (𝑅 − 𝐴))
103	94, 102	breqtrrd 4158	. . 3 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑄)) < (abs‘(𝐴 − 𝑅)))
104	67, 69, 103	ltapd 8969	. 2 ⊢ ((𝜑 ∧ 𝐴 < ((𝑄 + 𝑅) / 2)) → (abs‘(𝐴 − 𝑄)) # (abs‘(𝐴 − 𝑅)))
105		apdifflemf.ap	. . 3 ⊢ (𝜑 → ((𝑄 + 𝑅) / 2) # 𝐴)
106		reaplt 8919	. . . 4 ⊢ ((((𝑄 + 𝑅) / 2) ∈ ℝ ∧ 𝐴 ∈ ℝ) → (((𝑄 + 𝑅) / 2) # 𝐴 ↔ (((𝑄 + 𝑅) / 2) < 𝐴 ∨ 𝐴 < ((𝑄 + 𝑅) / 2))))
107	23, 1, 106	syl2anc 415	. . 3 ⊢ (𝜑 → (((𝑄 + 𝑅) / 2) # 𝐴 ↔ (((𝑄 + 𝑅) / 2) < 𝐴 ∨ 𝐴 < ((𝑄 + 𝑅) / 2))))
108	105, 107	mpbid 147	. 2 ⊢ (𝜑 → (((𝑄 + 𝑅) / 2) < 𝐴 ∨ 𝐴 < ((𝑄 + 𝑅) / 2)))
109	66, 104, 108	mpjaodan 810	1 ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) # (abs‘(𝐴 − 𝑅)))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℂcc 8178 ℝcr 8179 0cc0 8180 + caddc 8183 · cmul 8185 < clt 8361 − cmin 8499 # cap 8912 / cdiv 9005 2c2 9358 ℚcq 10029 ℝ⁺crp 10065 abscabs 11779

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-seqfrec 10900 df-exp 10991 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781

This theorem is used by: apdiff 17264

W3C validator