cgrabtwn - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cgrabtwn		Structured version Visualization version GIF version

Theorem cgrabtwn 28585

Description: Angle congruence preserves flat angles. Part of Theorem 11.21 of [Schwabhauser] p. 97. (Contributed by Thierry Arnoux, 9-Aug-2020.)

**Hypotheses**
Ref	Expression
cgracol.p	⊢ 𝑃 = (Base‘𝐺)
cgracol.i	⊢ 𝐼 = (Itv‘𝐺)
cgracol.m	⊢ − = (dist‘𝐺)
cgracol.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
cgracol.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
cgracol.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
cgracol.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
cgracol.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
cgracol.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
cgracol.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
cgracol.1	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
cgrabtwn.2	⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶))

**Assertion**
Ref	Expression
cgrabtwn	⊢ (𝜑 → 𝐸 ∈ (𝐷𝐼𝐹))

Proof of Theorem cgrabtwn Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cgracol.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		cgracol.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
3		eqid 2726	. . 3 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
4		simpllr 773	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝑥 ∈ 𝑃)
5		cgracol.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
6	5	ad3antrrr 727	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐷 ∈ 𝑃)
7		cgracol.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
8	7	ad3antrrr 727	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐹 ∈ 𝑃)
9		cgracol.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
10	9	ad3antrrr 727	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐺 ∈ TarskiG)
11		cgracol.e	. . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
12	11	ad3antrrr 727	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ 𝑃)
13		simpr2 1192	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝑥((hlG‘𝐺)‘𝐸)𝐷)
14		cgracol.m	. . . 4 ⊢ − = (dist‘𝐺)
15		simplr 766	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝑦 ∈ 𝑃)
16		simpr3 1193	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝑦((hlG‘𝐺)‘𝐸)𝐹)
17		eqid 2726	. . . . . . 7 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
18		cgracol.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
19	18	ad3antrrr 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐴 ∈ 𝑃)
20		cgracol.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
21	20	ad3antrrr 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐵 ∈ 𝑃)
22		cgracol.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
23	22	ad3antrrr 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐶 ∈ 𝑃)
24		simpr1 1191	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩)
25		cgrabtwn.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶))
26	25	ad3antrrr 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐵 ∈ (𝐴𝐼𝐶))
27	1, 14, 2, 17, 10, 19, 21, 23, 4, 12, 15, 24, 26	tgbtwnxfr 28289	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ (𝑥𝐼𝑦))
28	1, 14, 2, 10, 4, 12, 15, 27	tgbtwncom 28247	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ (𝑦𝐼𝑥))
29	1, 2, 3, 15, 8, 4, 10, 12, 16, 28	btwnhl 28373	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ (𝐹𝐼𝑥))
30	1, 14, 2, 10, 8, 12, 4, 29	tgbtwncom 28247	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ (𝑥𝐼𝐹))
31	1, 2, 3, 4, 6, 8, 10, 12, 13, 30	btwnhl 28373	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)) → 𝐸 ∈ (𝐷𝐼𝐹))
32		cgracol.1	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
33	1, 2, 3, 9, 18, 20, 22, 5, 11, 7	iscgra 28568	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹)))
34	32, 33	mpbid 231	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥((hlG‘𝐺)‘𝐸)𝐷 ∧ 𝑦((hlG‘𝐺)‘𝐸)𝐹))
35	31, 34	r19.29vva 3207	1 ⊢ (𝜑 → 𝐸 ∈ (𝐷𝐼𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∃wrex 3064 class class class wbr 5141 ‘cfv 6537 (class class class)co 7405 ⟨“cs3 14799 Basecbs 17153 distcds 17215 TarskiGcstrkg 28186 Itvcitv 28192 cgrGccgrg 28269 hlGchlg 28359 cgrAccgra 28566

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-oadd 8471 df-er 8705 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-dju 9898 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-xnn0 12549 df-z 12563 df-uz 12827 df-fz 13491 df-fzo 13634 df-hash 14296 df-word 14471 df-concat 14527 df-s1 14552 df-s2 14805 df-s3 14806 df-trkgc 28207 df-trkgb 28208 df-trkgcb 28209 df-trkg 28212 df-cgrg 28270 df-hlg 28360 df-cgra 28567

This theorem is referenced by: cgracol 28587

W3C validator