leagne2 - Metamath Proof Explorer

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

Theorem leagne2 27211

Description: Deduce inequality from the less-than angle relation. (Contributed by Thierry Arnoux, 25-Feb-2023.)

**Hypotheses**
Ref	Expression
isleag.p	⊢ 𝑃 = (Base‘𝐺)
isleag.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
isleag.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
isleag.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
isleag.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
isleag.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
isleag.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
isleag.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
leagne.1	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(≤_∠‘𝐺)⟨“𝐷𝐸𝐹”⟩)

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

Proof of Theorem leagne2 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isleag.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		eqid 2738	. . . 4 ⊢ (Itv‘𝐺) = (Itv‘𝐺)
3		eqid 2738	. . . 4 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
4		isleag.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐺 ∈ TarskiG)
6		isleag.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
7	6	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐴 ∈ 𝑃)
8		isleag.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
9	8	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐵 ∈ 𝑃)
10		isleag.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
11	10	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐶 ∈ 𝑃)
12		isleag.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
13	12	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐷 ∈ 𝑃)
14		isleag.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
15	14	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐸 ∈ 𝑃)
16		simplr 766	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝑥 ∈ 𝑃)
17		simprr 770	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)
18	1, 2, 3, 5, 7, 9, 11, 13, 15, 16, 17	cgrane2 27174	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐵 ≠ 𝐶)
19	18	necomd 2999	. 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐶 ≠ 𝐵)
20		leagne.1	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(≤_∠‘𝐺)⟨“𝐷𝐸𝐹”⟩)
21		isleag.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
22	1, 4, 6, 8, 10, 12, 14, 21	isleag 27208	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(≤_∠‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)))
23	20, 22	mpbid 231	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩))
24	19, 23	r19.29a 3218	1 ⊢ (𝜑 → 𝐶 ≠ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∃wrex 3065 class class class wbr 5074 ‘cfv 6433 ⟨“cs3 14555 Basecbs 16912 TarskiGcstrkg 26788 Itvcitv 26794 hlGchlg 26961 cgrAccgra 27168 inAcinag 27196 ≤_∠cleag 27197

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-fzo 13383 df-hash 14045 df-word 14218 df-concat 14274 df-s1 14301 df-s2 14561 df-s3 14562 df-trkgc 26809 df-trkgcb 26811 df-trkg 26814 df-cgrg 26872 df-hlg 26962 df-cgra 27169 df-leag 27207

This theorem is referenced by: (None)

W3C validator