| 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 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝐺 ∈ TarskiG) |
| 8 | mirval.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 9 | 8 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝐴 ∈ 𝑃) |
| 10 | mirfv.m | . . 3 ⊢ 𝑀 = (𝑆‘𝐴) | |
| 11 | miriso.1 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 12 | 11 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑋 ∈ 𝑃) |
| 13 | miriso.2 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 14 | 13 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑌 ∈ 𝑃) |
| 15 | mirbtwnb.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
| 16 | 15 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑍 ∈ 𝑃) |
| 17 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → 𝑌 ∈ (𝑋𝐼𝑍)) | |
| 18 | 1, 2, 3, 4, 5, 7, 9, 10, 12, 14, 16, 17 | mirbtwni 29062 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) |
| 19 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐺 ∈ TarskiG) |
| 20 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐴 ∈ 𝑃) |
| 21 | 1, 2, 3, 4, 5, 19, 20, 10 | mirf 29051 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑀:𝑃⟶𝑃) |
| 22 | 11 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑋 ∈ 𝑃) |
| 23 | 21, 22 | ffvelcdmd 7074 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑋) ∈ 𝑃) |
| 24 | 13 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ 𝑃) |
| 25 | 21, 24 | ffvelcdmd 7074 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ 𝑃) |
| 26 | 15 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑍 ∈ 𝑃) |
| 27 | 21, 26 | ffvelcdmd 7074 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑍) ∈ 𝑃) |
| 28 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) | |
| 29 | 1, 2, 3, 4, 5, 19, 20, 10, 23, 25, 27, 28 | mirbtwni 29062 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍)))) |
| 30 | 1, 2, 3, 4, 5, 6, 8, 10, 13 | mirmir 29053 | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑌)) = 𝑌) |
| 31 | 1, 2, 3, 4, 5, 6, 8, 10, 11 | mirmir 29053 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑋)) = 𝑋) |
| 32 | 1, 2, 3, 4, 5, 6, 8, 10, 15 | mirmir 29053 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑍)) = 𝑍) |
| 33 | 31, 32 | oveq12d 7427 | . . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) = (𝑋𝐼𝑍)) |
| 34 | 30, 33 | eleq12d 2854 | . . . 4 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) ↔ 𝑌 ∈ (𝑋𝐼𝑍))) |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → ((𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) ↔ 𝑌 ∈ (𝑋𝐼𝑍))) |
| 36 | 29, 35 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ (𝑋𝐼𝑍)) |
| 37 | 18, 36 | impbida 813 | 1 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6528 (class class class)co 7409 Basecbs 17334 distcds 17384 TarskiGcstrkg 28808 Itvcitv 28814 LineGclng 28815 pInvGcmir 29043 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 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 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-oadd 8459 df-er 8696 df-pm 8829 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-dju 9939 df-card 9977 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-2 12360 df-3 12361 df-n0 12562 df-xnn0 12635 df-z 12649 df-uz 12921 df-fz 13595 df-fzo 13743 df-hash 14428 df-word 14612 df-concat 14669 df-s1 14696 df-s2 14952 df-s3 14953 df-trkgc 28829 df-trkgb 28830 df-trkgcb 28831 df-trkg 28834 df-cgrg 28893 df-mir 29044 |
| This theorem is used by: mirbtwnhl 29071 |
| Copyright terms: Public domain | W3C validator |