Theorem snatpsubN 40688

Description: The singleton of an atom is a projective subspace. (Contributed by NM, 9-Sep-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
snpsub.a	⊢ 𝐴 = (Atoms‘𝐾)
snpsub.s	⊢ 𝑆 = (PSubSp‘𝐾)

Assertion

Ref	Expression
snatpsubN	⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → {𝑃} ∈ 𝑆)

Proof of Theorem snatpsubN

Dummy variables 𝑞 𝑝 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		snssi 4746	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → {𝑃} ⊆ 𝐴)
2	1	adantl 487	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → {𝑃} ⊆ 𝐴)
3		atllat 40238	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ AtLat → 𝐾 ∈ Lat)
4		eqid 2760	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝐾) = (Base‘𝐾)
5		snpsub.a	. . . . . . . . . . . . . . . 16 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 40227	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
7		eqid 2760	. . . . . . . . . . . . . . . 16 ⊢ (join‘𝐾) = (join‘𝐾)
8	4, 7	latjidm 18575	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾)) → (𝑃(join‘𝐾)𝑃) = 𝑃)
9	3, 6, 8	syl2an 608	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
10	9	adantr 486	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
11	10	breq2d 5115	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃) ↔ 𝑟(le‘𝐾)𝑃))
12		eqid 2760	. . . . . . . . . . . . . . . 16 ⊢ (le‘𝐾) = (le‘𝐾)
13	12, 5	atcmp 40249	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ AtLat ∧ 𝑟 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) → (𝑟(le‘𝐾)𝑃 ↔ 𝑟 = 𝑃))
14	13	3com23 1144	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑟 ∈ 𝐴) → (𝑟(le‘𝐾)𝑃 ↔ 𝑟 = 𝑃))
15	14	3expa 1136	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (𝑟(le‘𝐾)𝑃 ↔ 𝑟 = 𝑃))
16	15	biimpd 232	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (𝑟(le‘𝐾)𝑃 → 𝑟 = 𝑃))
17	11, 16	sylbid 243	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃) → 𝑟 = 𝑃))
18	17	adantld 496	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)) → 𝑟 = 𝑃))
19		velsn 4600	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ {𝑃} ↔ 𝑝 = 𝑃)
20		velsn 4600	. . . . . . . . . . . . 13 ⊢ (𝑞 ∈ {𝑃} ↔ 𝑞 = 𝑃)
21	19, 20	anbi12i 640	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ↔ (𝑝 = 𝑃 ∧ 𝑞 = 𝑃))
22	21	anbi1i 636	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)))
23		oveq12 7425	. . . . . . . . . . . . 13 ⊢ ((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) → (𝑝(join‘𝐾)𝑞) = (𝑃(join‘𝐾)𝑃))
24	23	breq2d 5115	. . . . . . . . . . . 12 ⊢ ((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ↔ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
25	24	pm5.32i 585	. . . . . . . . . . 11 ⊢ (((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
26	22, 25	bitri 278	. . . . . . . . . 10 ⊢ (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃 ∧ 𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
27		velsn 4600	. . . . . . . . . 10 ⊢ (𝑟 ∈ {𝑃} ↔ 𝑟 = 𝑃)
28	18, 26, 27	3imtr4g 299	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) ∧ 𝑟 ∈ 𝐴) → (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) → 𝑟 ∈ {𝑃}))
29	28	exp4b 436	. . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → (𝑟 ∈ 𝐴 → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
30	29	com23 87	. . . . . . 7 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → (𝑟 ∈ 𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
31	30	ralrimdv 3160	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → ∀𝑟 ∈ 𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃})))
32	31	ralrimivv 3203	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟 ∈ 𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))
33	2, 32	jca 521	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟 ∈ 𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃})))
34	33	ex 418	. . 3 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 → ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟 ∈ 𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
35		snpsub.s	. . . 4 ⊢ 𝑆 = (PSubSp‘𝐾)
36	12, 7, 5, 35	ispsubsp 40683	. . 3 ⊢ (𝐾 ∈ AtLat → ({𝑃} ∈ 𝑆 ↔ ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟 ∈ 𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
37	34, 36	sylibrd 262	. 2 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 → {𝑃} ∈ 𝑆))
38	37	imp 412	1 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → {𝑃} ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ⊆ wss 3899  {csn 4584   class class class wbr 5103  ‘cfv 6535  (class class class)co 7416  Basecbs 17326  lecple 17374  joincjn 18424  Latclat 18544  Atomscatm 40201  AtLatcal 40202  PSubSpcpsubsp 40434

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 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-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-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-ov 7419  df-oprab 7420  df-proset 18407  df-poset 18426  df-plt 18441  df-lub 18457  df-glb 18458  df-join 18459  df-meet 18460  df-p0 18536  df-lat 18545  df-covers 40204  df-ats 40205  df-atl 40236  df-psubsp 40441

This theorem is used by:  pointpsubN  40689  pclfinN  40838  pclfinclN  40888