| 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 484 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 6 | tgcgrcomlr.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 7 | 6 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 ∈ 𝑃) |
| 8 | tgcgrcomlr.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 9 | 8 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐷 ∈ 𝑃) |
| 10 | tgcgrcomlr.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 11 | 10 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 12 | tgcgrcomlr.6 | . . . . 5 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐷)) | |
| 13 | 12 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| 14 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 15 | 14 | oveq1d 7405 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐵 − 𝐵)) |
| 16 | 13, 15 | eqtr3d 2798 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐶 − 𝐷) = (𝐵 − 𝐵)) |
| 17 | 1, 2, 3, 5, 7, 9, 11, 16 | axtgcgrid 28619 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 = 𝐷) |
| 18 | 4 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐺 ∈ TarskiG) |
| 19 | tgcgrcomlr.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 20 | 19 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐴 ∈ 𝑃) |
| 21 | 10 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐵 ∈ 𝑃) |
| 22 | 8 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐷 ∈ 𝑃) |
| 23 | 12 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| 24 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐶 = 𝐷) | |
| 25 | 24 | oveq1d 7405 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐶 − 𝐷) = (𝐷 − 𝐷)) |
| 26 | 23, 25 | eqtrd 2796 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝐴 − 𝐵) = (𝐷 − 𝐷)) |
| 27 | 1, 2, 3, 18, 20, 21, 22, 26 | axtgcgrid 28619 | . 2 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐴 = 𝐵) |
| 28 | 17, 27 | impbida 810 | 1 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ‘cfv 6515 (class class class)co 7390 Basecbs 17235 distcds 17285 TarskiGcstrkg 28583 Itvcitv 28589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-nul 5253 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-iota 6471 df-fv 6523 df-ov 7393 df-trkgc 28604 df-trkg 28609 |
| This theorem is referenced by: tgcgreq 28638 tgcgrneq 28639 |
| Copyright terms: Public domain | W3C validator |