Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tgbtwnswapid | Structured version Visualization version GIF version |
Description: If you can swap the first two arguments of a betweenness statement, then those arguments are identical. Theorem 3.4 of [Schwabhauser] p. 30. (Contributed by Thierry Arnoux, 16-Mar-2019.) |
Ref | Expression |
---|---|
tkgeom.p | ⊢ 𝑃 = (Base‘𝐺) |
tkgeom.d | ⊢ − = (dist‘𝐺) |
tkgeom.i | ⊢ 𝐼 = (Itv‘𝐺) |
tkgeom.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
tgbtwnswapid.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
tgbtwnswapid.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
tgbtwnswapid.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
tgbtwnswapid.4 | ⊢ (𝜑 → 𝐴 ∈ (𝐵𝐼𝐶)) |
tgbtwnswapid.5 | ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶)) |
Ref | Expression |
---|---|
tgbtwnswapid | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tkgeom.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
2 | tkgeom.d | . . . 4 ⊢ − = (dist‘𝐺) | |
3 | tkgeom.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | tkgeom.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | 4 | ad2antrr 762 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐺 ∈ TarskiG) |
6 | tgbtwnswapid.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
7 | 6 | ad2antrr 762 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 ∈ 𝑃) |
8 | simplr 792 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ 𝑃) | |
9 | simprl 794 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐴𝐼𝐴)) | |
10 | 1, 2, 3, 5, 7, 8, 9 | axtgbtwnid 25365 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝑥) |
11 | tgbtwnswapid.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
12 | 11 | ad2antrr 762 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵 ∈ 𝑃) |
13 | simprr 796 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐵𝐼𝐵)) | |
14 | 1, 2, 3, 5, 12, 8, 13 | axtgbtwnid 25365 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵 = 𝑥) |
15 | 10, 14 | eqtr4d 2659 | . 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝐵) |
16 | tgbtwnswapid.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
17 | tgbtwnswapid.4 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (𝐵𝐼𝐶)) | |
18 | tgbtwnswapid.5 | . . 3 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶)) | |
19 | 1, 2, 3, 4, 11, 6, 16, 6, 11, 17, 18 | axtgpasch 25366 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) |
20 | 15, 19 | r19.29a 3078 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 distcds 15950 TarskiGcstrkg 25329 Itvcitv 25335 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-nul 4789 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 df-trkgb 25348 df-trkg 25352 |
This theorem is referenced by: legtri3 25485 |
Copyright terms: Public domain | W3C validator |