| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgbtwnexch2 | Structured version Visualization version GIF version | ||
| Description: Exchange the outer point of two betweenness statements. Right-hand side of Theorem 3.5 of [Schwabhauser] p. 30. (Contributed by Thierry Arnoux, 23-Mar-2019.) |
| Ref | Expression |
|---|---|
| tkgeom.p | ⊢ 𝑃 = (Base‘𝐺) |
| tkgeom.d | ⊢ − = (dist‘𝐺) |
| tkgeom.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tkgeom.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tgbtwnintr.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| tgbtwnintr.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| tgbtwnintr.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| tgbtwnintr.4 | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| tgbtwnexch2.1 | ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐷)) |
| tgbtwnexch2.2 | ⊢ (𝜑 → 𝐶 ∈ (𝐵𝐼𝐷)) |
| Ref | Expression |
|---|---|
| tgbtwnexch2 | ⊢ (𝜑 → 𝐶 ∈ (𝐴𝐼𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → 𝐵 = 𝐶) | |
| 2 | tgbtwnexch2.1 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐷)) | |
| 3 | 2 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → 𝐵 ∈ (𝐴𝐼𝐷)) |
| 4 | 1, 3 | eqeltrrd 2838 | . 2 ⊢ ((𝜑 ∧ 𝐵 = 𝐶) → 𝐶 ∈ (𝐴𝐼𝐷)) |
| 5 | tkgeom.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 6 | tkgeom.d | . . 3 ⊢ − = (dist‘𝐺) | |
| 7 | tkgeom.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 8 | tkgeom.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐺 ∈ TarskiG) |
| 10 | tgbtwnintr.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐴 ∈ 𝑃) |
| 12 | tgbtwnintr.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 13 | 12 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ 𝑃) |
| 14 | tgbtwnintr.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 15 | 14 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐶 ∈ 𝑃) |
| 16 | tgbtwnintr.4 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 17 | 16 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐷 ∈ 𝑃) |
| 18 | simpr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐵 ≠ 𝐶) | |
| 19 | tgbtwnexch2.2 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ (𝐵𝐼𝐷)) | |
| 20 | 19 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐶 ∈ (𝐵𝐼𝐷)) |
| 21 | 2 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ (𝐴𝐼𝐷)) |
| 22 | 5, 6, 7, 9, 15, 13, 11, 17, 20, 21 | tgbtwnintr 28575 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ (𝐶𝐼𝐴)) |
| 23 | 5, 6, 7, 9, 15, 13, 11, 22 | tgbtwncom 28570 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ (𝐴𝐼𝐶)) |
| 24 | 5, 6, 7, 9, 11, 13, 15, 17, 18, 23, 20 | tgbtwnouttr2 28577 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≠ 𝐶) → 𝐶 ∈ (𝐴𝐼𝐷)) |
| 25 | 4, 24 | pm2.61dane 3020 | 1 ⊢ (𝜑 → 𝐶 ∈ (𝐴𝐼𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 distcds 17220 TarskiGcstrkg 28509 Itvcitv 28515 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-nul 5241 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-iota 6448 df-fv 6500 df-ov 7363 df-trkgc 28530 df-trkgb 28531 df-trkgcb 28532 df-trkg 28535 |
| This theorem is referenced by: tgbtwnexch 28580 tgtrisegint 28581 tgbtwnconn1lem3 28656 legtri3 28672 miriso 28752 |
| Copyright terms: Public domain | W3C validator |