| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgcgreqb | Structured version Visualization version GIF version | ||
| Description: Congruence and equality. (Contributed by Thierry Arnoux, 27-Aug-2019.) |
| Ref | Expression |
|---|---|
| tkgeom.p | ⊢ 𝑃 = (Base‘𝐺) |
| tkgeom.d | ⊢ − = (dist‘𝐺) |
| tkgeom.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tkgeom.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tgcgrcomlr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| tgcgrcomlr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| tgcgrcomlr.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| tgcgrcomlr.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| tgcgrcomlr.6 | ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| Ref | Expression |
|---|---|
| tgcgreqb | ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tkgeom.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | tkgeom.d | . . 3 ⊢ − = (dist‘𝐺) | |
| 3 | tkgeom.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | tkgeom.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 6 | tgcgrcomlr.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 7 | 6 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 ∈ 𝑃) |
| 8 | tgcgrcomlr.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐷 ∈ 𝑃) |
| 10 | tgcgrcomlr.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 12 | tgcgrcomlr.6 | . . . . 5 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐷)) | |
| 13 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| 14 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 15 | 14 | oveq1d 7361 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐵 − 𝐵)) |
| 16 | 13, 15 | eqtr3d 2768 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐶 − 𝐷) = (𝐵 − 𝐵)) |
| 17 | 1, 2, 3, 5, 7, 9, 11, 16 | axtgcgrid 28442 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 = 𝐷) |
| 18 | 4 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐺 ∈ TarskiG) |
| 19 | tgcgrcomlr.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 20 | 19 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐴 ∈ 𝑃) |
| 21 | 10 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐵 ∈ 𝑃) |
| 22 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐷 ∈ 𝑃) |
| 23 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| 24 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐶 = 𝐷) | |
| 25 | 24 | oveq1d 7361 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐶 − 𝐷) = (𝐷 − 𝐷)) |
| 26 | 23, 25 | eqtrd 2766 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐴 − 𝐵) = (𝐷 − 𝐷)) |
| 27 | 1, 2, 3, 18, 20, 21, 22, 26 | axtgcgrid 28442 | . 2 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐴 = 𝐵) |
| 28 | 17, 27 | impbida 800 | 1 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ‘cfv 6481 (class class class)co 7346 Basecbs 17120 distcds 17170 TarskiGcstrkg 28406 Itvcitv 28412 |
| 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-ext 2703 ax-nul 5244 |
| 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-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rab 3396 df-v 3438 df-sbc 3742 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-iota 6437 df-fv 6489 df-ov 7349 df-trkgc 28427 df-trkg 28432 |
| This theorem is referenced by: tgcgreq 28461 tgcgrneq 28462 |
| Copyright terms: Public domain | W3C validator |