Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mirbtwnb | Structured version Visualization version GIF version |
Description: Point inversion preserves betweenness. Theorem 7.15 of [Schwabhauser] p. 51. (Contributed by Thierry Arnoux, 9-Jun-2019.) |
Ref | Expression |
---|---|
mirval.p | ⊢ 𝑃 = (Base‘𝐺) |
mirval.d | ⊢ − = (dist‘𝐺) |
mirval.i | ⊢ 𝐼 = (Itv‘𝐺) |
mirval.l | ⊢ 𝐿 = (LineG‘𝐺) |
mirval.s | ⊢ 𝑆 = (pInvG‘𝐺) |
mirval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
mirval.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
mirfv.m | ⊢ 𝑀 = (𝑆‘𝐴) |
miriso.1 | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
miriso.2 | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
mirbtwnb.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
Ref | Expression |
---|---|
mirbtwnb | ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mirval.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
2 | mirval.d | . . 3 ⊢ − = (dist‘𝐺) | |
3 | mirval.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | mirval.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
5 | mirval.s | . . 3 ⊢ 𝑆 = (pInvG‘𝐺) | |
6 | mirval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
7 | 6 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝐺 ∈ TarskiG) |
8 | mirval.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
9 | 8 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝐴 ∈ 𝑃) |
10 | mirfv.m | . . 3 ⊢ 𝑀 = (𝑆‘𝐴) | |
11 | miriso.1 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
12 | 11 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑋 ∈ 𝑃) |
13 | miriso.2 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
14 | 13 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑌 ∈ 𝑃) |
15 | mirbtwnb.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
16 | 15 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑍 ∈ 𝑃) |
17 | simpr 487 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑌 ∈ (𝑋𝐼𝑍)) | |
18 | 1, 2, 3, 4, 5, 7, 9, 10, 12, 14, 16, 17 | mirbtwni 26456 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) |
19 | 6 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐺 ∈ TarskiG) |
20 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐴 ∈ 𝑃) |
21 | 1, 2, 3, 4, 5, 19, 20, 10 | mirf 26445 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑀:𝑃⟶𝑃) |
22 | 11 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑋 ∈ 𝑃) |
23 | 21, 22 | ffvelrnd 6851 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑋) ∈ 𝑃) |
24 | 13 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ 𝑃) |
25 | 21, 24 | ffvelrnd 6851 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ 𝑃) |
26 | 15 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑍 ∈ 𝑃) |
27 | 21, 26 | ffvelrnd 6851 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑍) ∈ 𝑃) |
28 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) | |
29 | 1, 2, 3, 4, 5, 19, 20, 10, 23, 25, 27, 28 | mirbtwni 26456 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍)))) |
30 | 1, 2, 3, 4, 5, 6, 8, 10, 13 | mirmir 26447 | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑌)) = 𝑌) |
31 | 1, 2, 3, 4, 5, 6, 8, 10, 11 | mirmir 26447 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑋)) = 𝑋) |
32 | 1, 2, 3, 4, 5, 6, 8, 10, 15 | mirmir 26447 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑍)) = 𝑍) |
33 | 31, 32 | oveq12d 7173 | . . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) = (𝑋𝐼𝑍)) |
34 | 30, 33 | eleq12d 2907 | . . . 4 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) ↔ 𝑌 ∈ (𝑋𝐼𝑍))) |
35 | 34 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → ((𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) ↔ 𝑌 ∈ (𝑋𝐼𝑍))) |
36 | 29, 35 | mpbid 234 | . 2 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ (𝑋𝐼𝑍)) |
37 | 18, 36 | impbida 799 | 1 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ‘cfv 6354 (class class class)co 7155 Basecbs 16482 distcds 16573 TarskiGcstrkg 26215 Itvcitv 26221 LineGclng 26222 pInvGcmir 26437 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-pm 8408 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-dju 9329 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-n0 11897 df-xnn0 11967 df-z 11981 df-uz 12243 df-fz 12892 df-fzo 13033 df-hash 13690 df-word 13861 df-concat 13922 df-s1 13949 df-s2 14209 df-s3 14210 df-trkgc 26233 df-trkgb 26234 df-trkgcb 26235 df-trkg 26238 df-cgrg 26296 df-mir 26438 |
This theorem is referenced by: mirbtwnhl 26465 |
Copyright terms: Public domain | W3C validator |