| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cgr3id | Structured version Visualization version GIF version | ||
| Description: Reflexivity law for three-place congruence. (Contributed by Thierry Arnoux, 28-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 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| cgr3id | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐴𝐵𝐶”〉) |
| 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 | eqidd 2761 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐴 − 𝐵)) | |
| 9 | eqidd 2761 | . 2 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐵 − 𝐶)) | |
| 10 | eqidd 2761 | . 2 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐶 − 𝐴)) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 5, 6, 7, 8, 9, 10 | trgcgr 28986 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∼ 〈“𝐴𝐵𝐶”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6541 (class class class)co 7422 〈“cs3 14999 Basecbs 17394 distcds 17444 TarskiGcstrkg 28896 Itvcitv 28902 cgrGccgrg 28980 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-1o 8481 df-er 8722 df-pm 8855 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-card 10025 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-fz 13645 df-fzo 13794 df-hash 14480 df-word 14664 df-concat 14721 df-s1 14748 df-s2 15005 df-s3 15006 df-trkgc 28917 df-trkgcb 28919 df-trkg 28922 df-cgrg 28981 |
| This theorem is used by: lncgr 29039 cgraid 29333 |
| Copyright terms: Public domain | W3C validator |