oppperpex - Metamath Proof Explorer

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

Theorem oppperpex 28601

Description: Restating colperpex 28581 using the "opposite side of a line" relation. (Contributed by Thierry Arnoux, 2-Aug-2020.)

**Hypotheses**
Ref	Expression
hpg.p	⊢ 𝑃 = (Base‘𝐺)
hpg.d	⊢ − = (dist‘𝐺)
hpg.i	⊢ 𝐼 = (Itv‘𝐺)
hpg.o	⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
opphl.l	⊢ 𝐿 = (LineG‘𝐺)
opphl.d	⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
opphl.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
opphl.k	⊢ 𝐾 = (hlG‘𝐺)
oppperpex.1	⊢ (𝜑 → 𝐴 ∈ 𝐷)
oppperpex.2	⊢ (𝜑 → 𝐶 ∈ 𝑃)
oppperpex.3	⊢ (𝜑 → ¬ 𝐶 ∈ 𝐷)
oppperpex.4	⊢ (𝜑 → 𝐺Dim_TarskiG≥2)

**Assertion**
Ref	Expression
oppperpex	⊢ (𝜑 → ∃𝑝 ∈ 𝑃 ((𝐴𝐿𝑝)(⟂G‘𝐺)𝐷 ∧ 𝐶𝑂𝑝))

Distinct variable groups: 𝐷,𝑎,𝑏 𝐼,𝑎,𝑏 𝑃,𝑎,𝑏 𝐴,𝑝,𝑡 𝐷,𝑝,𝑡 𝐶,𝑝,𝑡 𝐺,𝑝,𝑡 𝑡,𝐿 𝐼,𝑝,𝑡 𝐾,𝑝,𝑡 𝑡,𝑂 𝑃,𝑝,𝑡 𝜑,𝑝,𝑡 − ,𝑝,𝑡 𝑡,𝑎,𝑏 𝐿,𝑝 Allowed substitution hints: 𝜑(𝑎,𝑏) 𝐴(𝑎,𝑏) 𝐶(𝑎,𝑏) 𝐺(𝑎,𝑏) 𝐾(𝑎,𝑏) 𝐿(𝑎,𝑏) − (𝑎,𝑏) 𝑂(𝑝,𝑎,𝑏)

Proof of Theorem oppperpex Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprrl 779	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥))
2		hpg.p	. . . . . . 7 ⊢ 𝑃 = (Base‘𝐺)
3		hpg.i	. . . . . . 7 ⊢ 𝐼 = (Itv‘𝐺)
4		opphl.l	. . . . . . 7 ⊢ 𝐿 = (LineG‘𝐺)
5		opphl.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
6	5	ad2antrr 724	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐺 ∈ TarskiG)
7		opphl.d	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
8	7	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐷 ∈ ran 𝐿)
9		oppperpex.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝐷)
10	9	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ∈ 𝐷)
11	2, 4, 3, 6, 8, 10	tglnpt 28397	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ∈ 𝑃)
12		simplr 767	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝑥 ∈ 𝐷)
13	2, 4, 3, 6, 8, 12	tglnpt 28397	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝑥 ∈ 𝑃)
14		simpr 483	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ≠ 𝑥)
15	2, 3, 4, 6, 11, 13, 14, 14, 8, 10, 12	tglinethru 28484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐷 = (𝐴𝐿𝑥))
16	15	adantr 479	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝐷 = (𝐴𝐿𝑥))
17	1, 16	breqtrrd 5171	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → (𝐴𝐿𝑝)(⟂G‘𝐺)𝐷)
18		oppperpex.3	. . . . . . 7 ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐷)
19	18	ad3antrrr 728	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → ¬ 𝐶 ∈ 𝐷)
20		hpg.d	. . . . . . 7 ⊢ − = (dist‘𝐺)
21	6	adantr 479	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝐺 ∈ TarskiG)
22	8	adantr 479	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝐷 ∈ ran 𝐿)
23	10	adantr 479	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝐴 ∈ 𝐷)
24		simprl 769	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝑝 ∈ 𝑃)
25	2, 20, 3, 4, 21, 22, 23, 24, 17	footne 28571	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → ¬ 𝑝 ∈ 𝐷)
26	14	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → 𝐴 ≠ 𝑥)
27	26	neneqd 2935	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → ¬ 𝐴 = 𝑥)
28		simprrl 779	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → (𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥))
29	28	orcomd 869	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → (𝐴 = 𝑥 ∨ 𝑡 ∈ (𝐴𝐿𝑥)))
30	29	ord 862	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → (¬ 𝐴 = 𝑥 → 𝑡 ∈ (𝐴𝐿𝑥)))
31	27, 30	mpd 15	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → 𝑡 ∈ (𝐴𝐿𝑥))
32	15	ad3antrrr 728	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → 𝐷 = (𝐴𝐿𝑥))
33	31, 32	eleqtrrd 2828	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → 𝑡 ∈ 𝐷)
34		simprrr 780	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → 𝑡 ∈ (𝐶𝐼𝑝))
35	33, 34	jca 510	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) ∧ (𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → (𝑡 ∈ 𝐷 ∧ 𝑡 ∈ (𝐶𝐼𝑝)))
36	35	ex 411	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) → ((𝑡 ∈ 𝑃 ∧ ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))) → (𝑡 ∈ 𝐷 ∧ 𝑡 ∈ (𝐶𝐼𝑝))))
37	36	reximdv2 3154	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) → (∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)) → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝)))
38	37	impr 453	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝))
39	38	anasss 465	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝))
40	19, 25, 39	jca31 513	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → ((¬ 𝐶 ∈ 𝐷 ∧ ¬ 𝑝 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝)))
41		hpg.o	. . . . . . . 8 ⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
42		oppperpex.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
43	42	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐶 ∈ 𝑃)
44	43	ad2antrr 724	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) → 𝐶 ∈ 𝑃)
45		simplr 767	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) → 𝑝 ∈ 𝑃)
46	2, 20, 3, 41, 44, 45	islnopp 28587	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ (𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥)) → (𝐶𝑂𝑝 ↔ ((¬ 𝐶 ∈ 𝐷 ∧ ¬ 𝑝 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝))))
47	46	adantrr 715	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ 𝑝 ∈ 𝑃) ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝)))) → (𝐶𝑂𝑝 ↔ ((¬ 𝐶 ∈ 𝐷 ∧ ¬ 𝑝 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝))))
48	47	anasss 465	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → (𝐶𝑂𝑝 ↔ ((¬ 𝐶 ∈ 𝐷 ∧ ¬ 𝑝 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐶𝐼𝑝))))
49	40, 48	mpbird 256	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → 𝐶𝑂𝑝)
50	17, 49	jca 510	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) ∧ (𝑝 ∈ 𝑃 ∧ ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))) → ((𝐴𝐿𝑝)(⟂G‘𝐺)𝐷 ∧ 𝐶𝑂𝑝))
51		oppperpex.4	. . . . 5 ⊢ (𝜑 → 𝐺Dim_TarskiG≥2)
52	51	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐺Dim_TarskiG≥2)
53	2, 20, 3, 4, 6, 11, 13, 43, 14, 52	colperpex 28581	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → ∃𝑝 ∈ 𝑃 ((𝐴𝐿𝑝)(⟂G‘𝐺)(𝐴𝐿𝑥) ∧ ∃𝑡 ∈ 𝑃 ((𝑡 ∈ (𝐴𝐿𝑥) ∨ 𝐴 = 𝑥) ∧ 𝑡 ∈ (𝐶𝐼𝑝))))
54	50, 53	reximddv 3161	. 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → ∃𝑝 ∈ 𝑃 ((𝐴𝐿𝑝)(⟂G‘𝐺)𝐷 ∧ 𝐶𝑂𝑝))
55	2, 3, 4, 5, 7, 9	tglnpt2 28489	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐷 𝐴 ≠ 𝑥)
56	54, 55	r19.29a 3152	1 ⊢ (𝜑 → ∃𝑝 ∈ 𝑃 ((𝐴𝐿𝑝)(⟂G‘𝐺)𝐷 ∧ 𝐶𝑂𝑝))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∃wrex 3060 ∖ cdif 3936 class class class wbr 5143 {copab 5205 ran crn 5673 ‘cfv 6543 (class class class)co 7416 2c2 12297 Basecbs 17179 distcds 17241 TarskiGcstrkg 28275 Dim_TarskiG≥cstrkgld 28279 Itvcitv 28281 LineGclng 28282 hlGchlg 28448 ⟂Gcperpg 28543

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-oadd 8489 df-er 8723 df-map 8845 df-pm 8846 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-dju 9924 df-card 9962 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-n0 12503 df-xnn0 12575 df-z 12589 df-uz 12853 df-fz 13517 df-fzo 13660 df-hash 14322 df-word 14497 df-concat 14553 df-s1 14578 df-s2 14831 df-s3 14832 df-trkgc 28296 df-trkgb 28297 df-trkgcb 28298 df-trkgld 28300 df-trkg 28301 df-cgrg 28359 df-leg 28431 df-mir 28501 df-rag 28542 df-perpg 28544

This theorem is referenced by: lnperpex 28651

W3C validator