ncoltgdim2 - Metamath Proof Explorer

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

Theorem ncoltgdim2 28845

Description: If there are three non-colinear points, then the dimension is at least two. Converse of tglowdim2l 28935. (Contributed by Thierry Arnoux, 23-Feb-2020.)

**Hypotheses**
Ref	Expression
tglngval.p	⊢ 𝑃 = (Base‘𝐺)
tglngval.l	⊢ 𝐿 = (LineG‘𝐺)
tglngval.i	⊢ 𝐼 = (Itv‘𝐺)
tglngval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
tglngval.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
tglngval.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
tgcolg.z	⊢ (𝜑 → 𝑍 ∈ 𝑃)
ncoltgdim2.1	⊢ (𝜑 → ¬ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))

**Assertion**
Ref	Expression
ncoltgdim2	⊢ (𝜑 → 𝐺Dim_TarskiG≥2)

**Proof of Theorem ncoltgdim2**
Step	Hyp	Ref	Expression
1		ncoltgdim2.1	. . 3 ⊢ (𝜑 → ¬ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
2		tglngval.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
3		tglngval.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
4		tglngval.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
5		tglngval.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
6	5	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → 𝐺 ∈ TarskiG)
7		tglngval.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
8	7	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → 𝑋 ∈ 𝑃)
9		tglngval.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
10	9	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → 𝑌 ∈ 𝑃)
11		tgcolg.z	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
12	11	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → 𝑍 ∈ 𝑃)
13		simpr 489	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → ¬ 𝐺Dim_TarskiG≥2)
14	2, 3, 4, 6, 8, 10, 12, 13	tgdim01ln 28844	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐺Dim_TarskiG≥2) → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
15	1, 14	mtand 827	. 2 ⊢ (𝜑 → ¬ ¬ 𝐺Dim_TarskiG≥2)
16	15	notnotrd 134	1 ⊢ (𝜑 → 𝐺Dim_TarskiG≥2)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 2c2 12301 Basecbs 17275 TarskiGcstrkg 28707 Dim_TarskiG≥cstrkgld 28711 Itvcitv 28713 LineGclng 28714

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-n0 12511 df-z 12598 df-uz 12869 df-fz 13542 df-fzo 13690 df-trkgc 28728 df-trkgcb 28730 df-trkgld 28732 df-trkg 28733

This theorem is used by: opptgdim2 29037 symquadmid 29119 trgcopy 29126 trgcopyeulem 29127 ragcgra 29157 cgrg3col4 29181 prlngex 29212 prlngmid2 29222 symquadprlng 29223 prlngsymquadlem 29224 prlngsymquad 29225 prlngsymquadopp 29226

W3C validator