| 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 29018 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) |
| 19 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐺 ∈ TarskiG) |
| 20 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐴 ∈ 𝑃) |
| 21 | 1, 2, 3, 4, 5, 19, 20, 10 | mirf 29007 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑀:𝑃⟶𝑃) |
| 22 | 11 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑋 ∈ 𝑃) |
| 23 | 21, 22 | ffvelcdmd 7081 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑋) ∈ 𝑃) |
| 24 | 13 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ 𝑃) |
| 25 | 21, 24 | ffvelcdmd 7081 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ 𝑃) |
| 26 | 15 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑍 ∈ 𝑃) |
| 27 | 21, 26 | ffvelcdmd 7081 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑍) ∈ 𝑃) |
| 28 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) | |
| 29 | 1, 2, 3, 4, 5, 19, 20, 10, 23, 25, 27, 28 | mirbtwni 29018 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍)))) |
| 30 | 1, 2, 3, 4, 5, 6, 8, 10, 13 | mirmir 29009 | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑌)) = 𝑌) |
| 31 | 1, 2, 3, 4, 5, 6, 8, 10, 11 | mirmir 29009 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑋)) = 𝑋) |
| 32 | 1, 2, 3, 4, 5, 6, 8, 10, 15 | mirmir 29009 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑍)) = 𝑍) |
| 33 | 31, 32 | oveq12d 7434 | . . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) = (𝑋𝐼𝑍)) |
| 34 | 30, 33 | eleq12d 2856 | . . . 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 6537 (class class class)co 7416 Basecbs 17303 distcds 17353 TarskiGcstrkg 28764 Itvcitv 28770 LineGclng 28771 pInvGcmir 28999 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-oadd 8462 df-er 8699 df-pm 8832 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-3 12329 df-n0 12530 df-xnn0 12603 df-z 12617 df-uz 12889 df-fz 13562 df-fzo 13710 df-hash 14395 df-word 14579 df-concat 14636 df-s1 14663 df-s2 14919 df-s3 14920 df-trkgc 28785 df-trkgb 28786 df-trkgcb 28787 df-trkg 28790 df-cgrg 28849 df-mir 29000 |
| This theorem is used by: mirbtwnhl 29027 |
| Copyright terms: Public domain | W3C validator |