| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > tg5segofs | Structured version Visualization version GIF version | ||
| Description: Rephrase axtg5seg 28551 using the outer five segment predicate. Theorem 2.10 of [Schwabhauser] p. 28. (Contributed by Thierry Arnoux, 23-Mar-2019.) |
| Ref | Expression |
|---|---|
| tg5segofs.p | ⊢ 𝑃 = (Base‘𝐺) |
| tg5segofs.m | ⊢ − = (dist‘𝐺) |
| tg5segofs.s | ⊢ 𝐼 = (Itv‘𝐺) |
| tg5segofs.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tg5segofs.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| tg5segofs.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| tg5segofs.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| tg5segofs.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| tg5segofs.e | ⊢ (𝜑 → 𝐸 ∈ 𝑃) |
| tg5segofs.f | ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| tg5segofs.o | ⊢ 𝑂 = (AFS‘𝐺) |
| tg5segofs.h | ⊢ (𝜑 → 𝐻 ∈ 𝑃) |
| tg5segofs.i | ⊢ (𝜑 → 𝐼 ∈ 𝑃) |
| tg5segofs.1 | ⊢ (𝜑 → 〈〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉〉𝑂〈〈𝐸, 𝐹〉, 〈𝐻, 𝐼〉〉) |
| tg5segofs.2 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| Ref | Expression |
|---|---|
| tg5segofs | ⊢ (𝜑 → (𝐶 − 𝐷) = (𝐻 − 𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tg5segofs.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | tg5segofs.m | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | tg5segofs.s | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | tg5segofs.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | tg5segofs.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 6 | tg5segofs.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 7 | tg5segofs.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 8 | tg5segofs.e | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 9 | tg5segofs.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
| 10 | tg5segofs.h | . 2 ⊢ (𝜑 → 𝐻 ∈ 𝑃) | |
| 11 | tg5segofs.d | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 12 | tg5segofs.i | . 2 ⊢ (𝜑 → 𝐼 ∈ 𝑃) | |
| 13 | tg5segofs.2 | . 2 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 14 | tg5segofs.1 | . . . . 5 ⊢ (𝜑 → 〈〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉〉𝑂〈〈𝐸, 𝐹〉, 〈𝐻, 𝐼〉〉) | |
| 15 | tg5segofs.o | . . . . . 6 ⊢ 𝑂 = (AFS‘𝐺) | |
| 16 | 1, 2, 3, 4, 15, 5, 6, 7, 11, 8, 9, 10, 12 | brafs 34856 | . . . . 5 ⊢ (𝜑 → (〈〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉〉𝑂〈〈𝐸, 𝐹〉, 〈𝐻, 𝐼〉〉 ↔ ((𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻)) ∧ ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻)) ∧ ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼))))) |
| 17 | 14, 16 | mpbid 233 | . . . 4 ⊢ (𝜑 → ((𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻)) ∧ ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻)) ∧ ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼)))) |
| 18 | 17 | simp1d 1148 | . . 3 ⊢ (𝜑 → (𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻))) |
| 19 | 18 | simpld 495 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶)) |
| 20 | 18 | simprd 496 | . 2 ⊢ (𝜑 → 𝐹 ∈ (𝐸𝐼𝐻)) |
| 21 | 17 | simp2d 1149 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻))) |
| 22 | 21 | simpld 495 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐸 − 𝐹)) |
| 23 | 21 | simprd 496 | . 2 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐹 − 𝐻)) |
| 24 | 17 | simp3d 1150 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼))) |
| 25 | 24 | simpld 495 | . 2 ⊢ (𝜑 → (𝐴 − 𝐷) = (𝐸 − 𝐼)) |
| 26 | 24 | simprd 496 | . 2 ⊢ (𝜑 → (𝐵 − 𝐷) = (𝐹 − 𝐼)) |
| 27 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 19, 20, 22, 23, 25, 26 | axtg5seg 28551 | 1 ⊢ (𝜑 → (𝐶 − 𝐷) = (𝐻 − 𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 〈cop 4561 class class class wbr 5072 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 distcds 17220 TarskiGcstrkg 28513 Itvcitv 28519 AFScafs 34853 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-iota 6441 df-fun 6487 df-fv 6493 df-ov 7359 df-trkgcb 28536 df-trkg 28539 df-afs 34854 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |