cgrane2 - Metamath Proof Explorer

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

Theorem cgrane2 29377

Description: Angles imply inequality. (Contributed by Thierry Arnoux, 1-Aug-2020.)

**Hypotheses**
Ref	Expression
iscgra.p	⊢ 𝑃 = (Base‘𝐺)
iscgra.i	⊢ 𝐼 = (Itv‘𝐺)
iscgra.k	⊢ 𝐾 = (hlG‘𝐺)
iscgra.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
iscgra.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
iscgra.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
iscgra.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
iscgra.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
iscgra.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
iscgra.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
cgrahl1.2	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)

**Assertion**
Ref	Expression
cgrane2	⊢ (𝜑 → 𝐵 ≠ 𝐶)

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

Step	Hyp	Ref	Expression
1		iscgra.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		eqid 2763	. . 3 ⊢ (dist‘𝐺) = (dist‘𝐺)
3		iscgra.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		iscgra.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐺 ∈ TarskiG)
6		iscgra.e	. . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
7	6	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐸 ∈ 𝑃)
8		simplr 781	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑦 ∈ 𝑃)
9		iscgra.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
10	9	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐵 ∈ 𝑃)
11		iscgra.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
12	11	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐶 ∈ 𝑃)
13		eqid 2763	. . . . 5 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
14		iscgra.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
15	14	ad3antrrr 743	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐴 ∈ 𝑃)
16		simpllr 788	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑥 ∈ 𝑃)
17		simpr1 1213	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩)
18	1, 2, 3, 13, 5, 15, 10, 12, 16, 7, 8, 17	cgr3simp2 29041	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐵(dist‘𝐺)𝐶) = (𝐸(dist‘𝐺)𝑦))
19	18	eqcomd 2769	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐸(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶))
20		iscgra.k	. . . . 5 ⊢ 𝐾 = (hlG‘𝐺)
21		iscgra.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
22	21	ad3antrrr 743	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐹 ∈ 𝑃)
23		simpr3 1215	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑦(𝐾‘𝐸)𝐹)
24	1, 3, 20, 8, 22, 7, 5, 23	hlne1 29128	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑦 ≠ 𝐸)
25	24	necomd 3014	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐸 ≠ 𝑦)
26	1, 2, 3, 5, 7, 8, 10, 12, 19, 25	tgcgrneq 29002	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐵 ≠ 𝐶)
27		cgrahl1.2	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
28		iscgra.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
29	1, 3, 20, 4, 14, 9, 11, 28, 6, 21	iscgra 29373	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)))
30	27, 29	mpbid 235	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))
31	26, 30	r19.29vva 3226	1 ⊢ (𝜑 → 𝐵 ≠ 𝐶)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ⟨“cs3 15035 Basecbs 17431 distcds 17481 TarskiGcstrkg 28946 Itvcitv 28952 cgrGccgrg 29030 hlGchlg 29120 cgrAccgra 29371

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-trkgc 28967 df-trkgcb 28969 df-trkg 28972 df-cgrg 29031 df-hlg 29121 df-cgra 29372

This theorem is used by: cgracgr 29382 cgracom 29386 cgratr 29387 cgraswaplr 29390 cgracol 29393 dfcgra2 29395 sacgr 29396 tgaaddcpbl2 29410 leagne2 29426 tgsas1 29456 tgasa1 29460 cgranbtwn 35409 morleylemrneab 35411

W3C validator