prjspnn0 - Mathbox for Steven Nguyen

	Mathbox for Steven Nguyen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > prjspnn0		Structured version Visualization version GIF version

Theorem prjspnn0 43468

Description: A projective point is nonempty. (Contributed by SN, 17-Jan-2025.)

**Hypotheses**
Ref	Expression
prjspnssbas.p	⊢ 𝑃 = (𝑁ℙ𝕣𝕠𝕛_n𝐾)
prjspnssbas.w	⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
prjspnssbas.b	⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
prjspnssbas.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
prjspnssbas.k	⊢ (𝜑 → 𝐾 ∈ DivRing)
prjspnn0.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)

**Assertion**
Ref	Expression
prjspnn0	⊢ (𝜑 → 𝐴 ≠ ∅)

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

Step	Hyp	Ref	Expression
1		eqid 2760	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))}
2		prjspnssbas.w	. . . 4 ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
3		prjspnssbas.b	. . . 4 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
4		eqid 2760	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
5		eqid 2760	. . . 4 ⊢ ( ·_𝑠 ‘𝑊) = ( ·_𝑠 ‘𝑊)
6		prjspnssbas.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ DivRing)
7	1, 2, 3, 4, 5, 6	prjspner 43465	. . 3 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} Er 𝐵)
8		erdm 8707	. . 3 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} Er 𝐵 → dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} = 𝐵)
9	7, 8	syl 18	. 2 ⊢ (𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} = 𝐵)
10		prjspnn0.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
11		prjspnssbas.p	. . . 4 ⊢ 𝑃 = (𝑁ℙ𝕣𝕠𝕛_n𝐾)
12		prjspnssbas.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
13	1, 2, 3, 4, 5	prjspnval2 43464	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐾 ∈ DivRing) → (𝑁ℙ𝕣𝕠𝕛_n𝐾) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))}))
14	12, 6, 13	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝑁ℙ𝕣𝕠𝕛_n𝐾) = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))}))
15	11, 14	eqtrid 2807	. . 3 ⊢ (𝜑 → 𝑃 = (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))}))
16	10, 15	eleqtrd 2862	. 2 ⊢ (𝜑 → 𝐴 ∈ (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))}))
17		elqsn0 8784	. 2 ⊢ ((dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))} = 𝐵 ∧ 𝐴 ∈ (𝐵 / {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ (Base‘𝐾)𝑥 = (𝑙( ·_𝑠 ‘𝑊)𝑦))})) → 𝐴 ≠ ∅)
18	9, 16, 17	syl2anc 596	1 ⊢ (𝜑 → 𝐴 ≠ ∅)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∃wrex 3086 ∖ cdif 3896 ∅c0 4279 {csn 4584 {copab 5167 dom cdm 5655 ‘cfv 6533 (class class class)co 7413 Er wer 8693 / cqs 8695 0cc0 11124 ℕ₀cn0 12528 ...cfz 13561 Basecbs 17301 ·_𝑠 cvsca 17346 0_gc0g 17524 DivRingcdr 20890 freeLMod cfrlm 21959 ℙ𝕣𝕠𝕛_ncprjspn 43460

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201

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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-tpos 8224 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-ec 8698 df-qs 8702 df-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-fz 13562 df-struct 17239 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-hom 17366 df-cco 17367 df-0g 17526 df-prds 17532 df-pws 17534 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-sbg 19062 df-subg 19246 df-cmn 19909 df-abl 19910 df-mgp 20274 df-rng 20288 df-ur 20321 df-ring 20374 df-oppr 20478 df-dvdsr 20498 df-unit 20499 df-invr 20529 df-subrg 20732 df-drng 20892 df-lmod 21046 df-lss 21116 df-lvec 21287 df-sra 21357 df-rgmod 21358 df-dsmm 21945 df-frlm 21960 df-prjsp 43448 df-prjspn 43461

This theorem is used by: prjcrv0 43479

W3C validator