Theorem mirconn 29006

Description: Point inversion of connectedness. (Contributed by Thierry Arnoux, 2-Mar-2020.)

Hypotheses

Ref	Expression
mirval.p	⊢ 𝑃 = (Base‘𝐺)
mirval.d	⊢ − = (dist‘𝐺)
mirval.i	⊢ 𝐼 = (Itv‘𝐺)
mirval.l	⊢ 𝐿 = (LineG‘𝐺)
mirval.s	⊢ 𝑆 = (pInvG‘𝐺)
mirval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
mirconn.m	⊢ 𝑀 = (𝑆‘𝐴)
mirconn.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
mirconn.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
mirconn.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
mirconn.1	⊢ (𝜑 → (𝑋 ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼𝑋)))

Assertion

Ref	Expression
mirconn	⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))

Proof of Theorem mirconn

Step	Hyp	Ref	Expression
1		mirval.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		mirval.d	. . 3 ⊢ − = (dist‘𝐺)
3		mirval.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		mirval.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝐺 ∈ TarskiG)
6		mirconn.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
7	6	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝑋 ∈ 𝑃)
8		mirconn.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
9	8	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝐴 ∈ 𝑃)
10		mirval.l	. . . . 5 ⊢ 𝐿 = (LineG‘𝐺)
11		mirval.s	. . . . 5 ⊢ 𝑆 = (pInvG‘𝐺)
12		mirconn.m	. . . . 5 ⊢ 𝑀 = (𝑆‘𝐴)
13		mirconn.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
14	1, 2, 3, 10, 11, 4, 8, 12, 13	mircl 28989	. . . 4 ⊢ (𝜑 → (𝑀‘𝑌) ∈ 𝑃)
15	14	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → (𝑀‘𝑌) ∈ 𝑃)
16	13	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝑌 ∈ 𝑃)
17		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝑋 ∈ (𝐴𝐼𝑌))
18	1, 2, 3, 10, 11, 4, 8, 12, 13	mirbtwn 28986	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ((𝑀‘𝑌)𝐼𝑌))
19	18	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝐴 ∈ ((𝑀‘𝑌)𝐼𝑌))
20	1, 2, 3, 5, 7, 9, 15, 16, 17, 19	tgbtwnintr 28813	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴𝐼𝑌)) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))
21	1, 2, 3, 4, 6, 8	tgbtwntriv2 28807	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼𝐴))
22	21	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → 𝐴 ∈ (𝑋𝐼𝐴))
23		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → 𝑌 = 𝐴)
24	23	fveq2d 6889	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → (𝑀‘𝑌) = (𝑀‘𝐴))
25	1, 2, 3, 10, 11, 4, 8, 12	mircinv 28996	. . . . . . . 8 ⊢ (𝜑 → (𝑀‘𝐴) = 𝐴)
26	25	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → (𝑀‘𝐴) = 𝐴)
27	24, 26	eqtrd 2800	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → (𝑀‘𝑌) = 𝐴)
28	27	oveq2d 7435	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → (𝑋𝐼(𝑀‘𝑌)) = (𝑋𝐼𝐴))
29	22, 28	eleqtrrd 2868	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = 𝐴) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))
30	29	adantlr 728	. . 3 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 = 𝐴) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))
31	4	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝐺 ∈ TarskiG)
32	6	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝑋 ∈ 𝑃)
33	13	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝑌 ∈ 𝑃)
34	8	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝐴 ∈ 𝑃)
35	14	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → (𝑀‘𝑌) ∈ 𝑃)
36		simpr 490	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝑌 ≠ 𝐴)
37		simplr 781	. . . . 5 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝑌 ∈ (𝐴𝐼𝑋))
38	1, 2, 3, 31, 34, 33, 32, 37	tgbtwncom 28808	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝑌 ∈ (𝑋𝐼𝐴))
39	1, 2, 3, 4, 14, 8, 13, 18	tgbtwncom 28808	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝑌𝐼(𝑀‘𝑌)))
40	39	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝐴 ∈ (𝑌𝐼(𝑀‘𝑌)))
41	1, 2, 3, 31, 32, 33, 34, 35, 36, 38, 40	tgbtwnouttr2 28815	. . 3 ⊢ (((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) ∧ 𝑌 ≠ 𝐴) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))
42	30, 41	pm2.61dane 3047	. 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐴𝐼𝑋)) → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))
43		mirconn.1	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐴𝐼𝑌) ∨ 𝑌 ∈ (𝐴𝐼𝑋)))
44	20, 42, 43	mpjaodan 973	1 ⊢ (𝜑 → 𝐴 ∈ (𝑋𝐼(𝑀‘𝑌)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  distcds 17341  TarskiGcstrkg 28747  Itvcitv 28753  LineGclng 28754  pInvGcmir 28980

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-trkgc 28768  df-trkgb 28769  df-trkgcb 28770  df-trkg 28773  df-mir 28981

This theorem is used by:  mirbtwnhl  29008