mirbtwnhl - Metamath Proof Explorer

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

Theorem mirbtwnhl 28915

Description: If the center of the point inversion 𝐴 is between two points 𝑋 and 𝑌, then the half lines are mirrored. (Contributed by Thierry Arnoux, 3-Mar-2020.)

**Hypotheses**
Ref	Expression
mirval.p	⊢ 𝑃 = (Base‘𝐺)
mirval.d	⊢ − = (dist‘𝐺)
mirval.i	⊢ 𝐼 = (Itv‘𝐺)
mirval.l	⊢ 𝐿 = (LineG‘𝐺)
mirval.s	⊢ 𝑆 = (pInvG‘𝐺)
mirval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
mirhl.m	⊢ 𝑀 = (𝑆‘𝐴)
mirhl.k	⊢ 𝐾 = (hlG‘𝐺)
mirhl.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
mirhl.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
mirhl.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
mirhl.z	⊢ (𝜑 → 𝑍 ∈ 𝑃)
mirbtwnhl.1	⊢ (𝜑 → 𝑋 ≠ 𝐴)
mirbtwnhl.2	⊢ (𝜑 → 𝑌 ≠ 𝐴)
mirbtwnhl.3	⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼𝑌))

**Assertion**
Ref	Expression
mirbtwnhl	⊢ (𝜑 → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))

**Proof of Theorem mirbtwnhl**
Step	Hyp	Ref	Expression
1		simpr 489	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → 𝑍 = 𝐴)
2		mirval.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
3		mirval.i	. . . . . 6 ⊢ 𝐼 = (Itv‘𝐺)
4		mirhl.k	. . . . . 6 ⊢ 𝐾 = (hlG‘𝐺)
5		mirhl.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
6		mirhl.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
7		mirval.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
8	2, 3, 4, 5, 6, 5, 7	hleqnid 28839	. . . . 5 ⊢ (𝜑 → ¬ 𝐴(𝐾‘𝐴)𝑋)
9	8	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝐴(𝐾‘𝐴)𝑋)
10	1, 9	eqnbrtrd 5130	. . 3 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝑍(𝐾‘𝐴)𝑋)
11	1	fveq2d 6883	. . . . 5 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑀‘𝑍) = (𝑀‘𝐴))
12		mirval.d	. . . . . . 7 ⊢ − = (dist‘𝐺)
13		mirval.l	. . . . . . 7 ⊢ 𝐿 = (LineG‘𝐺)
14		mirval.s	. . . . . . 7 ⊢ 𝑆 = (pInvG‘𝐺)
15		mirhl.m	. . . . . . 7 ⊢ 𝑀 = (𝑆‘𝐴)
16	2, 12, 3, 13, 14, 7, 5, 15	mircinv 28903	. . . . . 6 ⊢ (𝜑 → (𝑀‘𝐴) = 𝐴)
17	16	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑀‘𝐴) = 𝐴)
18	11, 17	eqtrd 2804	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑀‘𝑍) = 𝐴)
19		mirhl.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
20	2, 3, 4, 5, 19, 5, 7	hleqnid 28839	. . . . 5 ⊢ (𝜑 → ¬ 𝐴(𝐾‘𝐴)𝑌)
21	20	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝐴(𝐾‘𝐴)𝑌)
22	18, 21	eqnbrtrd 5130	. . 3 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ (𝑀‘𝑍)(𝐾‘𝐴)𝑌)
23	10, 22	2falsed 379	. 2 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))
24		simplr 780	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑍 ≠ 𝐴)
25	24	neneqd 2969	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ¬ 𝑍 = 𝐴)
26	7	ad3antrrr 742	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝐺 ∈ TarskiG)
27	5	ad3antrrr 742	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝐴 ∈ 𝑃)
28		mirhl.z	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
29	28	ad3antrrr 742	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝑍 ∈ 𝑃)
30		simpr 489	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝑍) = 𝐴)
31	16	ad3antrrr 742	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝐴) = 𝐴)
32	30, 31	eqtr4d 2807	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝑍) = (𝑀‘𝐴))
33	2, 12, 3, 13, 14, 26, 27, 15, 29, 27, 32	mireq 28900	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝑍 = 𝐴)
34	25, 33	mtand 827	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ¬ (𝑀‘𝑍) = 𝐴)
35	34	neqned 2971	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍) ≠ 𝐴)
36		mirbtwnhl.2	. . . . 5 ⊢ (𝜑 → 𝑌 ≠ 𝐴)
37	36	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑌 ≠ 𝐴)
38	7	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐺 ∈ TarskiG)
39	6	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑋 ∈ 𝑃)
40	5	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ 𝑃)
41	2, 12, 3, 13, 14, 7, 5, 15, 28	mircl 28896	. . . . . 6 ⊢ (𝜑 → (𝑀‘𝑍) ∈ 𝑃)
42	41	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍) ∈ 𝑃)
43	19	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑌 ∈ 𝑃)
44		mirbtwnhl.1	. . . . . 6 ⊢ (𝜑 → 𝑋 ≠ 𝐴)
45	44	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑋 ≠ 𝐴)
46	28	ad2antrr 738	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑍 ∈ 𝑃)
47	2, 3, 4, 28, 6, 5, 7	ishlg 28833	. . . . . . . . . 10 ⊢ (𝜑 → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
48	47	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
49	48	biimpa 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍))))
50	49	simp3d 1160	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))
51	50	orcomd 884	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑋 ∈ (𝐴𝐼𝑍) ∨ 𝑍 ∈ (𝐴𝐼𝑋)))
52	2, 12, 3, 13, 14, 38, 15, 40, 39, 46, 51	mirconn 28913	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑍)))
53		mirbtwnhl.3	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼𝑌))
54	53	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ (𝑋𝐼𝑌))
55	2, 3, 38, 39, 40, 42, 43, 45, 52, 54	tgbtwnconn2 28807	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))
56	2, 3, 4, 41, 19, 5, 7	ishlg 28833	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
57	56	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
58	57	adantr 485	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
59	35, 37, 55, 58	mpbir3and 1359	. . 3 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍)(𝐾‘𝐴)𝑌)
60		simplr 780	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍 ≠ 𝐴)
61	44	ad2antrr 738	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑋 ≠ 𝐴)
62	7	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐺 ∈ TarskiG)
63	19	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑌 ∈ 𝑃)
64	5	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ 𝑃)
65	28	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍 ∈ 𝑃)
66	6	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑋 ∈ 𝑃)
67	36	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑌 ≠ 𝐴)
68	16	ad2antrr 738	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝐴) = 𝐴)
69	41	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝑍) ∈ 𝑃)
70	2, 12, 3, 13, 14, 62, 64, 15, 63	mircl 28896	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝑌) ∈ 𝑃)
71	57	biimpa 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍)))))
72	71	simp3d 1160	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))
73	2, 12, 3, 13, 14, 62, 15, 64, 69, 63, 72	mirconn 28913	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ ((𝑀‘𝑍)𝐼(𝑀‘𝑌)))
74	2, 12, 3, 62, 69, 64, 70, 73	tgbtwncom 28719	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍)))
75	68, 74	eqeltrd 2869	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝐴) ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍)))
76	2, 12, 3, 13, 14, 62, 64, 15, 63, 64, 65	mirbtwnb 28907	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝐴 ∈ (𝑌𝐼𝑍) ↔ (𝑀‘𝐴) ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍))))
77	75, 76	mpbird 260	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ (𝑌𝐼𝑍))
78	2, 12, 3, 7, 6, 5, 19, 53	tgbtwncom 28719	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑌𝐼𝑋))
79	78	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ (𝑌𝐼𝑋))
80	2, 3, 62, 63, 64, 65, 66, 67, 77, 79	tgbtwnconn2 28807	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))
81	48	adantr 485	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
82	60, 61, 80, 81	mpbir3and 1359	. . 3 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍(𝐾‘𝐴)𝑋)
83	59, 82	impbida 812	. 2 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))
84	23, 83	pm2.61dane 3051	1 ⊢ (𝜑 → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 class class class wbr 5110 ‘cfv 6534 (class class class)co 7408 Basecbs 17265 distcds 17315 TarskiGcstrkg 28658 Itvcitv 28664 LineGclng 28665 hlGchlg 28831 pInvGcmir 28887

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-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173

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 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-xnn0 12574 df-z 12588 df-uz 12859 df-fz 13532 df-fzo 13679 df-hash 14363 df-word 14547 df-concat 14604 df-s1 14630 df-s2 14881 df-s3 14882 df-trkgc 28679 df-trkgb 28680 df-trkgcb 28681 df-trkg 28684 df-cgrg 28742 df-hlg 28832 df-mir 28888

This theorem is referenced by: opphllem6 28988

W3C validator