Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cgr3tr | Structured version Visualization version GIF version |
Description: Transitivity law for three-place congruence. (Contributed by Thierry Arnoux, 27-Apr-2019.) |
Ref | Expression |
---|---|
tgcgrxfr.p | ⊢ 𝑃 = (Base‘𝐺) |
tgcgrxfr.m | ⊢ − = (dist‘𝐺) |
tgcgrxfr.i | ⊢ 𝐼 = (Itv‘𝐺) |
tgcgrxfr.r | ⊢ ∼ = (cgrG‘𝐺) |
tgcgrxfr.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
tgbtwnxfr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
tgbtwnxfr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
tgbtwnxfr.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
tgbtwnxfr.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
tgbtwnxfr.e | ⊢ (𝜑 → 𝐸 ∈ 𝑃) |
tgbtwnxfr.f | ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
tgbtwnxfr.2 | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐷𝐸𝐹”〉) |
cgr3tr.j | ⊢ (𝜑 → 𝐽 ∈ 𝑃) |
cgr3tr.k | ⊢ (𝜑 → 𝐾 ∈ 𝑃) |
cgr3tr.l | ⊢ (𝜑 → 𝐿 ∈ 𝑃) |
cgr3tr.1 | ⊢ (𝜑 → 〈“𝐷𝐸𝐹”〉 ∼ 〈“𝐽𝐾𝐿”〉) |
Ref | Expression |
---|---|
cgr3tr | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐽𝐾𝐿”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tgcgrxfr.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
2 | tgcgrxfr.m | . 2 ⊢ − = (dist‘𝐺) | |
3 | tgcgrxfr.r | . 2 ⊢ ∼ = (cgrG‘𝐺) | |
4 | tgcgrxfr.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | tgbtwnxfr.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
6 | tgbtwnxfr.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
7 | tgbtwnxfr.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
8 | cgr3tr.j | . 2 ⊢ (𝜑 → 𝐽 ∈ 𝑃) | |
9 | cgr3tr.k | . 2 ⊢ (𝜑 → 𝐾 ∈ 𝑃) | |
10 | cgr3tr.l | . 2 ⊢ (𝜑 → 𝐿 ∈ 𝑃) | |
11 | tgcgrxfr.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
12 | tgbtwnxfr.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
13 | tgbtwnxfr.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
14 | tgbtwnxfr.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
15 | tgbtwnxfr.2 | . . . 4 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐷𝐸𝐹”〉) | |
16 | 1, 2, 11, 3, 4, 5, 6, 7, 12, 13, 14, 15 | cgr3simp1 26862 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) |
17 | cgr3tr.1 | . . . 4 ⊢ (𝜑 → 〈“𝐷𝐸𝐹”〉 ∼ 〈“𝐽𝐾𝐿”〉) | |
18 | 1, 2, 11, 3, 4, 12, 13, 14, 8, 9, 10, 17 | cgr3simp1 26862 | . . 3 ⊢ (𝜑 → (𝐷 − 𝐸) = (𝐽 − 𝐾)) |
19 | 16, 18 | eqtrd 2779 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐽 − 𝐾)) |
20 | 1, 2, 11, 3, 4, 5, 6, 7, 12, 13, 14, 15 | cgr3simp2 26863 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) |
21 | 1, 2, 11, 3, 4, 12, 13, 14, 8, 9, 10, 17 | cgr3simp2 26863 | . . 3 ⊢ (𝜑 → (𝐸 − 𝐹) = (𝐾 − 𝐿)) |
22 | 20, 21 | eqtrd 2779 | . 2 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐾 − 𝐿)) |
23 | 1, 2, 11, 3, 4, 5, 6, 7, 12, 13, 14, 15 | cgr3simp3 26864 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
24 | 1, 2, 11, 3, 4, 12, 13, 14, 8, 9, 10, 17 | cgr3simp3 26864 | . . 3 ⊢ (𝜑 → (𝐹 − 𝐷) = (𝐿 − 𝐽)) |
25 | 23, 24 | eqtrd 2779 | . 2 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐿 − 𝐽)) |
26 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 19, 22, 25 | trgcgr 26858 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐽𝐾𝐿”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2109 class class class wbr 5078 ‘cfv 6430 (class class class)co 7268 〈“cs3 14536 Basecbs 16893 distcds 16952 TarskiGcstrkg 26769 Itvcitv 26775 cgrGccgrg 26852 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-cnex 10911 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 ax-pre-mulgt0 10932 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-int 4885 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-pred 6199 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7701 df-1st 7817 df-2nd 7818 df-frecs 8081 df-wrecs 8112 df-recs 8186 df-rdg 8225 df-1o 8281 df-er 8472 df-pm 8592 df-en 8708 df-dom 8709 df-sdom 8710 df-fin 8711 df-card 9681 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 df-sub 11190 df-neg 11191 df-nn 11957 df-2 12019 df-3 12020 df-n0 12217 df-z 12303 df-uz 12565 df-fz 13222 df-fzo 13365 df-hash 14026 df-word 14199 df-concat 14255 df-s1 14282 df-s2 14542 df-s3 14543 df-trkgc 26790 df-trkgcb 26792 df-trkg 26795 df-cgrg 26853 |
This theorem is referenced by: tgbtwnxfr 26872 |
Copyright terms: Public domain | W3C validator |