opphllem2 - Metamath Proof Explorer

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

Theorem opphllem2 28922

Description: Lemma for opphl 28928. Lemma 9.3 of [Schwabhauser] p. 68. (Contributed by Thierry Arnoux, 21-Dec-2019.)

**Hypotheses**
Ref	Expression
hpg.p	⊢ 𝑃 = (Base‘𝐺)
hpg.d	⊢ − = (dist‘𝐺)
hpg.i	⊢ 𝐼 = (Itv‘𝐺)
hpg.o	⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
opphl.l	⊢ 𝐿 = (LineG‘𝐺)
opphl.d	⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
opphl.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
opphllem1.s	⊢ 𝑆 = ((pInvG‘𝐺)‘𝑀)
opphllem1.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
opphllem1.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
opphllem1.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
opphllem1.r	⊢ (𝜑 → 𝑅 ∈ 𝐷)
opphllem1.o	⊢ (𝜑 → 𝐴𝑂𝐶)
opphllem1.m	⊢ (𝜑 → 𝑀 ∈ 𝐷)
opphllem1.n	⊢ (𝜑 → 𝐴 = (𝑆‘𝐶))
opphllem1.x	⊢ (𝜑 → 𝐴 ≠ 𝑅)
opphllem1.y	⊢ (𝜑 → 𝐵 ≠ 𝑅)
opphllem2.z	⊢ (𝜑 → (𝐴 ∈ (𝑅𝐼𝐵) ∨ 𝐵 ∈ (𝑅𝐼𝐴)))

**Assertion**
Ref	Expression
opphllem2	⊢ (𝜑 → 𝐵𝑂𝐶)

Distinct variable groups: 𝐷,𝑎,𝑏 𝐼,𝑎,𝑏 𝑃,𝑎,𝑏 𝑡,𝐴 𝑡,𝐵 𝑡,𝐷 𝑡,𝑅 𝑡,𝐶 𝑡,𝐺 𝑡,𝐿 𝑡,𝐼 𝑡,𝑀 𝑡,𝑂 𝑡,𝑃 𝑡,𝑆 𝜑,𝑡 𝑡, − 𝑡,𝑎,𝑏 Allowed substitution hints: 𝜑(𝑎,𝑏) 𝐴(𝑎,𝑏) 𝐵(𝑎,𝑏) 𝐶(𝑎,𝑏) 𝑅(𝑎,𝑏) 𝑆(𝑎,𝑏) 𝐺(𝑎,𝑏) 𝐿(𝑎,𝑏) 𝑀(𝑎,𝑏) − (𝑎,𝑏) 𝑂(𝑎,𝑏)

**Proof of Theorem opphllem2**
Step	Hyp	Ref	Expression
1		hpg.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		hpg.d	. . 3 ⊢ − = (dist‘𝐺)
3		hpg.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		hpg.o	. . 3 ⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
5		opphl.l	. . 3 ⊢ 𝐿 = (LineG‘𝐺)
6		opphl.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
7	6	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐷 ∈ ran 𝐿)
8		opphl.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
9	8	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐺 ∈ TarskiG)
10		opphllem1.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
11	10	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐶 ∈ 𝑃)
12		opphllem1.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
13	12	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐵 ∈ 𝑃)
14		opphllem1.s	. . . 4 ⊢ 𝑆 = ((pInvG‘𝐺)‘𝑀)
15		eqid 2763	. . . . 5 ⊢ (pInvG‘𝐺) = (pInvG‘𝐺)
16		opphllem1.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ 𝐷)
17	1, 5, 3, 8, 6, 16	tglnpt 28719	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑃)
18	17	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝑀 ∈ 𝑃)
19	1, 2, 3, 5, 15, 9, 18, 14, 13	mircl 28835	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐵) ∈ 𝑃)
20	16	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝑀 ∈ 𝐷)
21		opphllem1.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ 𝐷)
22	21	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝑅 ∈ 𝐷)
23	1, 2, 3, 5, 15, 9, 14, 7, 20, 22	mirln 28850	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝑅) ∈ 𝐷)
24		simpr 488	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
25		simplr 778	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝐷)
26	24, 25	eqeltrd 2863	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝐷)
27	8	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐺 ∈ TarskiG)
28	12	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝑃)
29	1, 5, 3, 8, 6, 21	tglnpt 28719	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ 𝑃)
30	29	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝑅 ∈ 𝑃)
31		opphllem1.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
32	31	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ 𝑃)
33		opphllem1.y	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ≠ 𝑅)
34	33	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐵 ≠ 𝑅)
35	34	necomd 3013	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝑅 ≠ 𝐵)
36		simpllr 785	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ (𝑅𝐼𝐵))
37	1, 3, 5, 27, 30, 28, 32, 35, 36	btwnlng1 28789	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ (𝑅𝐿𝐵))
38	1, 3, 5, 27, 28, 30, 32, 34, 37	lncom 28792	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ (𝐵𝐿𝑅))
39	6	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐷 ∈ ran 𝐿)
40		simplr 778	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝐷)
41	21	ad3antrrr 740	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝑅 ∈ 𝐷)
42	1, 3, 5, 27, 28, 30, 34, 34, 39, 40, 41	tglinethru 28806	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐷 = (𝐵𝐿𝑅))
43	38, 42	eleqtrrd 2866	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ 𝐷)
44	26, 43	pm2.61dane 3045	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) → 𝐴 ∈ 𝐷)
45		opphllem1.o	. . . . . . . . 9 ⊢ (𝜑 → 𝐴𝑂𝐶)
46	1, 2, 3, 4, 5, 6, 8, 31, 10, 45	oppne1 28915	. . . . . . . 8 ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷)
47	46	ad2antrr 736	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ 𝐵 ∈ 𝐷) → ¬ 𝐴 ∈ 𝐷)
48	44, 47	pm2.65da 826	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → ¬ 𝐵 ∈ 𝐷)
49	9	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝐺 ∈ TarskiG)
50	18	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝑀 ∈ 𝑃)
51	13	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝐵 ∈ 𝑃)
52	1, 2, 3, 5, 15, 49, 50, 14, 51	mirmir 28836	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → (𝑆‘(𝑆‘𝐵)) = 𝐵)
53	7	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝐷 ∈ ran 𝐿)
54	20	adantr 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝑀 ∈ 𝐷)
55		simpr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → (𝑆‘𝐵) ∈ 𝐷)
56	1, 2, 3, 5, 15, 49, 14, 53, 54, 55	mirln 28850	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → (𝑆‘(𝑆‘𝐵)) ∈ 𝐷)
57	52, 56	eqeltrrd 2864	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) ∧ (𝑆‘𝐵) ∈ 𝐷) → 𝐵 ∈ 𝐷)
58	48, 57	mtand 825	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → ¬ (𝑆‘𝐵) ∈ 𝐷)
59	1, 2, 3, 5, 15, 9, 18, 14, 13	mirbtwn 28832	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝑀 ∈ ((𝑆‘𝐵)𝐼𝐵))
60	1, 2, 3, 4, 19, 13, 20, 58, 48, 59	islnoppd 28914	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐵)𝑂𝐵)
61		eqidd 2764	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐵) = (𝑆‘𝐵))
62		nelne2 3056	. . . . . 6 ⊢ (((𝑆‘𝑅) ∈ 𝐷 ∧ ¬ (𝑆‘𝐵) ∈ 𝐷) → (𝑆‘𝑅) ≠ (𝑆‘𝐵))
63	23, 58, 62	syl2anc 593	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝑅) ≠ (𝑆‘𝐵))
64	63	necomd 3013	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐵) ≠ (𝑆‘𝑅))
65	1, 2, 3, 4, 5, 6, 8, 31, 10, 45	oppne2 28916	. . . . . . 7 ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐷)
66	65	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → ¬ 𝐶 ∈ 𝐷)
67		nelne2 3056	. . . . . 6 ⊢ (((𝑆‘𝑅) ∈ 𝐷 ∧ ¬ 𝐶 ∈ 𝐷) → (𝑆‘𝑅) ≠ 𝐶)
68	23, 66, 67	syl2anc 593	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝑅) ≠ 𝐶)
69	68	necomd 3013	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐶 ≠ (𝑆‘𝑅))
70		opphllem1.n	. . . . . . . 8 ⊢ (𝜑 → 𝐴 = (𝑆‘𝐶))
71	70	eqcomd 2769	. . . . . . 7 ⊢ (𝜑 → (𝑆‘𝐶) = 𝐴)
72	1, 2, 3, 5, 15, 8, 17, 14, 10, 71	mircom 28837	. . . . . 6 ⊢ (𝜑 → (𝑆‘𝐴) = 𝐶)
73	72	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐴) = 𝐶)
74	29	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝑅 ∈ 𝑃)
75	31	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐴 ∈ 𝑃)
76		simpr 488	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐴 ∈ (𝑅𝐼𝐵))
77	1, 2, 3, 5, 15, 9, 18, 14, 74, 75, 13, 76	mirbtwni 28845	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → (𝑆‘𝐴) ∈ ((𝑆‘𝑅)𝐼(𝑆‘𝐵)))
78	73, 77	eqeltrrd 2864	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐶 ∈ ((𝑆‘𝑅)𝐼(𝑆‘𝐵)))
79	1, 2, 3, 4, 5, 7, 9, 14, 19, 11, 13, 23, 60, 20, 61, 64, 69, 78	opphllem1 28921	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐶𝑂𝐵)
80	1, 2, 3, 4, 5, 7, 9, 11, 13, 79	oppcom 28918	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝑅𝐼𝐵)) → 𝐵𝑂𝐶)
81	6	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐷 ∈ ran 𝐿)
82	8	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐺 ∈ TarskiG)
83	31	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐴 ∈ 𝑃)
84	12	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐵 ∈ 𝑃)
85	10	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐶 ∈ 𝑃)
86	21	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝑅 ∈ 𝐷)
87	45	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐴𝑂𝐶)
88	16	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝑀 ∈ 𝐷)
89	70	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐴 = (𝑆‘𝐶))
90		opphllem1.x	. . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝑅)
91	90	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐴 ≠ 𝑅)
92	33	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐵 ≠ 𝑅)
93		simpr 488	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐵 ∈ (𝑅𝐼𝐴))
94	1, 2, 3, 4, 5, 81, 82, 14, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93	opphllem1 28921	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝑅𝐼𝐴)) → 𝐵𝑂𝐶)
95		opphllem2.z	. 2 ⊢ (𝜑 → (𝐴 ∈ (𝑅𝐼𝐵) ∨ 𝐵 ∈ (𝑅𝐼𝐴)))
96	80, 94, 95	mpjaodan 971	1 ⊢ (𝜑 → 𝐵𝑂𝐶)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 858 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3087 ∖ cdif 3902 class class class wbr 5101 {copab 5163 ran crn 5649 ‘cfv 6522 (class class class)co 7397 Basecbs 17246 distcds 17296 TarskiGcstrkg 28597 Itvcitv 28603 LineGclng 28604 pInvGcmir 28826

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-1o 8438 df-oadd 8442 df-er 8679 df-pm 8812 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-dju 9860 df-card 9898 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-nn 12212 df-2 12281 df-3 12282 df-n0 12483 df-xnn0 12556 df-z 12570 df-uz 12841 df-fz 13514 df-fzo 13661 df-hash 14345 df-word 14528 df-concat 14585 df-s1 14611 df-s2 14862 df-s3 14863 df-trkgc 28618 df-trkgb 28619 df-trkgcb 28620 df-trkg 28623 df-cgrg 28681 df-mir 28827

This theorem is referenced by: opphllem4 28924 opphl 28928

W3C validator