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 26468

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 487	. . . 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 26396	. . . . 5 ⊢ (𝜑 → ¬ 𝐴(𝐾‘𝐴)𝑋)
9	8	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝐴(𝐾‘𝐴)𝑋)
10	1, 9	eqnbrtrd 5086	. . 3 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝑍(𝐾‘𝐴)𝑋)
11	1	fveq2d 6676	. . . . 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 26456	. . . . . 6 ⊢ (𝜑 → (𝑀‘𝐴) = 𝐴)
17	16	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑀‘𝐴) = 𝐴)
18	11, 17	eqtrd 2858	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑀‘𝑍) = 𝐴)
19		mirhl.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
20	2, 3, 4, 5, 19, 5, 7	hleqnid 26396	. . . . 5 ⊢ (𝜑 → ¬ 𝐴(𝐾‘𝐴)𝑌)
21	20	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ 𝐴(𝐾‘𝐴)𝑌)
22	18, 21	eqnbrtrd 5086	. . 3 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → ¬ (𝑀‘𝑍)(𝐾‘𝐴)𝑌)
23	10, 22	2falsed 379	. 2 ⊢ ((𝜑 ∧ 𝑍 = 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))
24		simplr 767	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑍 ≠ 𝐴)
25	24	neneqd 3023	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ¬ 𝑍 = 𝐴)
26	7	ad3antrrr 728	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝐺 ∈ TarskiG)
27	5	ad3antrrr 728	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝐴 ∈ 𝑃)
28		mirhl.z	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
29	28	ad3antrrr 728	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝑍 ∈ 𝑃)
30		simpr 487	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝑍) = 𝐴)
31	16	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝐴) = 𝐴)
32	30, 31	eqtr4d 2861	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → (𝑀‘𝑍) = (𝑀‘𝐴))
33	2, 12, 3, 13, 14, 26, 27, 15, 29, 27, 32	mireq 26453	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) ∧ (𝑀‘𝑍) = 𝐴) → 𝑍 = 𝐴)
34	25, 33	mtand 814	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ¬ (𝑀‘𝑍) = 𝐴)
35	34	neqned 3025	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍) ≠ 𝐴)
36		mirbtwnhl.2	. . . . 5 ⊢ (𝜑 → 𝑌 ≠ 𝐴)
37	36	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑌 ≠ 𝐴)
38	7	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐺 ∈ TarskiG)
39	6	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑋 ∈ 𝑃)
40	5	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ 𝑃)
41	2, 12, 3, 13, 14, 7, 5, 15, 28	mircl 26449	. . . . . 6 ⊢ (𝜑 → (𝑀‘𝑍) ∈ 𝑃)
42	41	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍) ∈ 𝑃)
43	19	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑌 ∈ 𝑃)
44		mirbtwnhl.1	. . . . . 6 ⊢ (𝜑 → 𝑋 ≠ 𝐴)
45	44	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑋 ≠ 𝐴)
46	28	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝑍 ∈ 𝑃)
47	2, 3, 4, 28, 6, 5, 7	ishlg 26390	. . . . . . . . . 10 ⊢ (𝜑 → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
48	47	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
49	48	biimpa 479	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍))))
50	49	simp3d 1140	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))
51	50	orcomd 867	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑋 ∈ (𝐴𝐼𝑍) ∨ 𝑍 ∈ (𝐴𝐼𝑋)))
52	2, 12, 3, 13, 14, 38, 15, 40, 39, 46, 51	mirconn 26466	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑍)))
53		mirbtwnhl.3	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼𝑌))
54	53	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → 𝐴 ∈ (𝑋𝐼𝑌))
55	2, 3, 38, 39, 40, 42, 43, 45, 52, 54	tgbtwnconn2 26364	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))
56	2, 3, 4, 41, 19, 5, 7	ishlg 26390	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
57	56	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
58	57	adantr 483	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → ((𝑀‘𝑍)(𝐾‘𝐴)𝑌 ↔ ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))))
59	35, 37, 55, 58	mpbir3and 1338	. . 3 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ 𝑍(𝐾‘𝐴)𝑋) → (𝑀‘𝑍)(𝐾‘𝐴)𝑌)
60		simplr 767	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍 ≠ 𝐴)
61	44	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑋 ≠ 𝐴)
62	7	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐺 ∈ TarskiG)
63	19	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑌 ∈ 𝑃)
64	5	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ 𝑃)
65	28	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍 ∈ 𝑃)
66	6	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑋 ∈ 𝑃)
67	36	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑌 ≠ 𝐴)
68	16	ad2antrr 724	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝐴) = 𝐴)
69	41	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝑍) ∈ 𝑃)
70	2, 12, 3, 13, 14, 62, 64, 15, 63	mircl 26449	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝑌) ∈ 𝑃)
71	57	biimpa 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → ((𝑀‘𝑍) ≠ 𝐴 ∧ 𝑌 ≠ 𝐴 ∧ ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍)))))
72	71	simp3d 1140	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → ((𝑀‘𝑍) ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼(𝑀‘𝑍))))
73	2, 12, 3, 13, 14, 62, 15, 64, 69, 63, 72	mirconn 26466	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ ((𝑀‘𝑍)𝐼(𝑀‘𝑌)))
74	2, 12, 3, 62, 69, 64, 70, 73	tgbtwncom 26276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍)))
75	68, 74	eqeltrd 2915	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑀‘𝐴) ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍)))
76	2, 12, 3, 13, 14, 62, 64, 15, 63, 64, 65	mirbtwnb 26460	. . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝐴 ∈ (𝑌𝐼𝑍) ↔ (𝑀‘𝐴) ∈ ((𝑀‘𝑌)𝐼(𝑀‘𝑍))))
77	75, 76	mpbird 259	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ (𝑌𝐼𝑍))
78	2, 12, 3, 7, 6, 5, 19, 53	tgbtwncom 26276	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑌𝐼𝑋))
79	78	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝐴 ∈ (𝑌𝐼𝑋))
80	2, 3, 62, 63, 64, 65, 66, 67, 77, 79	tgbtwnconn2 26364	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))
81	48	adantr 483	. . . 4 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑍 ≠ 𝐴 ∧ 𝑋 ≠ 𝐴 ∧ (𝑍 ∈ (𝐴𝐼𝑋) ∨ 𝑋 ∈ (𝐴𝐼𝑍)))))
82	60, 61, 80, 81	mpbir3and 1338	. . 3 ⊢ (((𝜑 ∧ 𝑍 ≠ 𝐴) ∧ (𝑀‘𝑍)(𝐾‘𝐴)𝑌) → 𝑍(𝐾‘𝐴)𝑋)
83	59, 82	impbida 799	. 2 ⊢ ((𝜑 ∧ 𝑍 ≠ 𝐴) → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))
84	23, 83	pm2.61dane 3106	1 ⊢ (𝜑 → (𝑍(𝐾‘𝐴)𝑋 ↔ (𝑀‘𝑍)(𝐾‘𝐴)𝑌))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 distcds 16576 TarskiGcstrkg 26218 Itvcitv 26224 LineGclng 26225 hlGchlg 26388 pInvGcmir 26440

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-dju 9332 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-xnn0 11971 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-concat 13925 df-s1 13952 df-s2 14212 df-s3 14213 df-trkgc 26236 df-trkgb 26237 df-trkgcb 26238 df-trkg 26241 df-cgrg 26299 df-hlg 26389 df-mir 26441

This theorem is referenced by: opphllem6 26540

W3C validator