| 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 29170 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑋𝐼𝑍)) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) |
| 19 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐺 ∈ TarskiG) |
| 20 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝐴 ∈ 𝑃) |
| 21 | 1, 2, 3, 4, 5, 19, 20, 10 | mirf 29159 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑀:𝑃⟶𝑃) |
| 22 | 11 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑋 ∈ 𝑃) |
| 23 | 21, 22 | ffvelcdmd 7106 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑋) ∈ 𝑃) |
| 24 | 13 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑌 ∈ 𝑃) |
| 25 | 21, 24 | ffvelcdmd 7106 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ 𝑃) |
| 26 | 15 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → 𝑍 ∈ 𝑃) |
| 27 | 21, 26 | ffvelcdmd 7106 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑍) ∈ 𝑃) |
| 28 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) | |
| 29 | 1, 2, 3, 4, 5, 19, 20, 10, 23, 25, 27, 28 | mirbtwni 29170 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝑌) ∈ ((𝑀‘𝑋)𝐼(𝑀‘𝑍))) → (𝑀‘(𝑀‘𝑌)) ∈ ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍)))) |
| 30 | 1, 2, 3, 4, 5, 6, 8, 10, 13 | mirmir 29161 | . . . . 5 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑌)) = 𝑌) |
| 31 | 1, 2, 3, 4, 5, 6, 8, 10, 11 | mirmir 29161 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑋)) = 𝑋) |
| 32 | 1, 2, 3, 4, 5, 6, 8, 10, 15 | mirmir 29161 | . . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝑍)) = 𝑍) |
| 33 | 31, 32 | oveq12d 7458 | . . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝑋))𝐼(𝑀‘(𝑀‘𝑍))) = (𝑋𝐼𝑍)) |
| 34 | 30, 33 | eleq12d 2858 | . . . 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 2147 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 distcds 17463 TarskiGcstrkg 28916 Itvcitv 28922 LineGclng 28923 pInvGcmir 29151 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-oadd 8505 df-er 8742 df-pm 8875 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-dju 10006 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-n0 12631 df-xnn0 12704 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-hash 14499 df-word 14683 df-concat 14740 df-s1 14767 df-s2 15024 df-s3 15025 df-trkgc 28937 df-trkgb 28938 df-trkgcb 28939 df-trkg 28942 df-cgrg 29001 df-mir 29152 |
| This theorem is used by: mirbtwnhl 29179 |
| Copyright terms: Public domain | W3C validator |