leagne3 - Metamath Proof Explorer

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

Theorem leagne3 29052

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
leagne3	⊢ (𝜑 → 𝐷 ≠ 𝐸)

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

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

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3087 class class class wbr 5101 ‘cfv 6521 ⟨“cs3 14865 Basecbs 17255 TarskiGcstrkg 28603 Itvcitv 28609 hlGchlg 28776 cgrAccgra 29008 inAcinag 29036 ≤_∠cleag 29037

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-map 8810 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9909 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-nn 12221 df-2 12290 df-3 12291 df-n0 12492 df-z 12579 df-uz 12850 df-fz 13523 df-fzo 13670 df-hash 14354 df-word 14537 df-concat 14594 df-s1 14620 df-s2 14871 df-s3 14872 df-hlg 28777 df-cgra 29009 df-leag 29047

This theorem is referenced by: (None)

W3C validator