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 28986

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 2752	. . . 4 ⊢ (Itv‘𝐺) = (Itv‘𝐺)
3		eqid 2752	. . . 4 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
4		isleag.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐺 ∈ TarskiG)
6		isleag.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
7	6	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐴 ∈ 𝑃)
8		isleag.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
9	8	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐵 ∈ 𝑃)
10		isleag.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
11	10	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐶 ∈ 𝑃)
12		isleag.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
13	12	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐷 ∈ 𝑃)
14		isleag.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
15	14	ad2antrr 734	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐸 ∈ 𝑃)
16		simplr 776	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝑥 ∈ 𝑃)
17		simprr 780	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)
18	1, 2, 3, 5, 7, 9, 11, 13, 15, 16, 17	cgrane3 28949	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐸 ≠ 𝐷)
19	18	necomd 3002	. 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)) → 𝐷 ≠ 𝐸)
20		leagne.1	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(≤_∠‘𝐺)⟨“𝐷𝐸𝐹”⟩)
21		isleag.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
22	1, 4, 6, 8, 10, 12, 14, 21	isleag 28982	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(≤_∠‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩)))
23	20, 22	mpbid 234	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥(inA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑥”⟩))
24	19, 23	r19.29a 3160	1 ⊢ (𝜑 → 𝐷 ≠ 𝐸)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∃wrex 3076 class class class wbr 5090 ‘cfv 6506 ⟨“cs3 14841 Basecbs 17217 TarskiGcstrkg 28562 Itvcitv 28568 hlGchlg 28735 cgrAccgra 28942 inAcinag 28970 ≤_∠cleag 28971

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-er 8662 df-map 8794 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-z 12555 df-uz 12826 df-fz 13499 df-fzo 13646 df-hash 14330 df-word 14513 df-concat 14570 df-s1 14596 df-s2 14847 df-s3 14848 df-hlg 28736 df-cgra 28943 df-leag 28981

This theorem is referenced by: (None)

W3C validator