| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgbtwntriv2 | Structured version Visualization version GIF version | ||
| Description: Betweenness always holds for the second endpoint. Theorem 3.1 of [Schwabhauser] p. 30. (Contributed by Thierry Arnoux, 15-Mar-2019.) |
| Ref | Expression |
|---|---|
| tkgeom.p | ⊢ 𝑃 = (Base‘𝐺) |
| tkgeom.d | ⊢ − = (dist‘𝐺) |
| tkgeom.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tkgeom.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tgbtwntriv2.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| tgbtwntriv2.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| tgbtwntriv2 | ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprl 783 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝑥)) | |
| 2 | tkgeom.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 3 | tkgeom.d | . . . . . 6 ⊢ − = (dist‘𝐺) | |
| 4 | tkgeom.i | . . . . . 6 ⊢ 𝐼 = (Itv‘𝐺) | |
| 5 | tkgeom.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | 5 | ad2antrr 739 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐺 ∈ TarskiG) |
| 7 | tgbtwntriv2.2 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 8 | 7 | ad2antrr 739 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 ∈ 𝑃) |
| 9 | simplr 781 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝑥 ∈ 𝑃) | |
| 10 | simpr 490 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → (𝐵 − 𝑥) = (𝐵 − 𝐵)) | |
| 11 | 2, 3, 4, 6, 8, 9, 8, 10 | axtgcgrid 28982 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 = 𝑥) |
| 12 | 11 | adantrl 729 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 = 𝑥) |
| 13 | 12 | oveq2d 7467 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → (𝐴𝐼𝐵) = (𝐴𝐼𝑥)) |
| 14 | 1, 13 | eleqtrrd 2867 | . 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝐵)) |
| 15 | tgbtwntriv2.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 16 | 2, 3, 4, 5, 15, 7, 7, 7 | axtgsegcon 28983 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) |
| 17 | 14, 16 | r19.29a 3174 | 1 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 distcds 17481 TarskiGcstrkg 28946 Itvcitv 28952 |
| 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-ext 2735 ax-nul 5266 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574 df-ov 7454 df-trkgc 28967 df-trkgcb 28969 df-trkg 28972 |
| This theorem is used by: tgbtwncom 29008 tgbtwntriv1 29011 tgcolg 29074 legid 29107 hlid 29132 lnhl 29138 tglinerflx2 29159 mirreu3 29183 mirconn 29207 symquadlem 29218 outpasch 29290 hlpasch 29291 plngrotlem1 29322 angmgmaddcpbl 29447 |
| Copyright terms: Public domain | W3C validator |