| 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 28441 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 34680 | . . . . 5 ⊢ (𝜑 → (〈〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉〉𝑂〈〈𝐸, 𝐹〉, 〈𝐻, 𝐼〉〉 ↔ ((𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻)) ∧ ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻)) ∧ ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼))))) |
| 17 | 14, 16 | mpbid 232 | . . . 4 ⊢ (𝜑 → ((𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻)) ∧ ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻)) ∧ ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼)))) |
| 18 | 17 | simp1d 1142 | . . 3 ⊢ (𝜑 → (𝐵 ∈ (𝐴𝐼𝐶) ∧ 𝐹 ∈ (𝐸𝐼𝐻))) |
| 19 | 18 | simpld 494 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶)) |
| 20 | 18 | simprd 495 | . 2 ⊢ (𝜑 → 𝐹 ∈ (𝐸𝐼𝐻)) |
| 21 | 17 | simp2d 1143 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐸 − 𝐹) ∧ (𝐵 − 𝐶) = (𝐹 − 𝐻))) |
| 22 | 21 | simpld 494 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐸 − 𝐹)) |
| 23 | 21 | simprd 495 | . 2 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐹 − 𝐻)) |
| 24 | 17 | simp3d 1144 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝐷) = (𝐸 − 𝐼) ∧ (𝐵 − 𝐷) = (𝐹 − 𝐼))) |
| 25 | 24 | simpld 494 | . 2 ⊢ (𝜑 → (𝐴 − 𝐷) = (𝐸 − 𝐼)) |
| 26 | 24 | simprd 495 | . 2 ⊢ (𝜑 → (𝐵 − 𝐷) = (𝐹 − 𝐼)) |
| 27 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 19, 20, 22, 23, 25, 26 | axtg5seg 28441 | 1 ⊢ (𝜑 → (𝐶 − 𝐷) = (𝐻 − 𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 〈cop 4582 class class class wbr 5091 ‘cfv 6481 (class class class)co 7346 Basecbs 17117 distcds 17167 TarskiGcstrkg 28403 Itvcitv 28409 AFScafs 34677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-iota 6437 df-fun 6483 df-fv 6489 df-ov 7349 df-trkgcb 28426 df-trkg 28429 df-afs 34678 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |