pclfinclN - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > pclfinclN		Structured version Visualization version GIF version

Theorem pclfinclN 38809

Description: The projective subspace closure of a finite set of atoms is a closed subspace. Compare the (non-closed) subspace version pclfinN 38759 and also pclcmpatN 38760. (Contributed by NM, 13-Sep-2013.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
pclfincl.a	⊢ 𝐴 = (Atoms‘𝐾)
pclfincl.c	⊢ 𝑈 = (PCl‘𝐾)
pclfincl.s	⊢ 𝑆 = (PSubCl‘𝐾)

**Assertion**
Ref	Expression
pclfinclN	⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑋 ∈ Fin) → (𝑈‘𝑋) ∈ 𝑆)

Proof of Theorem pclfinclN Dummy variables 𝑞 𝑝 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq1 4006	. . . . . 6 ⊢ (𝑥 = ∅ → (𝑥 ⊆ 𝐴 ↔ ∅ ⊆ 𝐴))
2	1	anbi2d 629	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) ↔ (𝐾 ∈ HL ∧ ∅ ⊆ 𝐴)))
3		fveq2 6888	. . . . . 6 ⊢ (𝑥 = ∅ → (𝑈‘𝑥) = (𝑈‘∅))
4	3	eleq1d 2818	. . . . 5 ⊢ (𝑥 = ∅ → ((𝑈‘𝑥) ∈ 𝑆 ↔ (𝑈‘∅) ∈ 𝑆))
5	2, 4	imbi12d 344	. . . 4 ⊢ (𝑥 = ∅ → (((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) → (𝑈‘𝑥) ∈ 𝑆) ↔ ((𝐾 ∈ HL ∧ ∅ ⊆ 𝐴) → (𝑈‘∅) ∈ 𝑆)))
6		sseq1 4006	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴))
7	6	anbi2d 629	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) ↔ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)))
8		fveq2 6888	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑈‘𝑥) = (𝑈‘𝑦))
9	8	eleq1d 2818	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑈‘𝑥) ∈ 𝑆 ↔ (𝑈‘𝑦) ∈ 𝑆))
10	7, 9	imbi12d 344	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) → (𝑈‘𝑥) ∈ 𝑆) ↔ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑈‘𝑦) ∈ 𝑆)))
11		sseq1 4006	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∪ {𝑧}) ⊆ 𝐴))
12	11	anbi2d 629	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) ↔ (𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)))
13		fveq2 6888	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝑈‘𝑥) = (𝑈‘(𝑦 ∪ {𝑧})))
14	13	eleq1d 2818	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝑈‘𝑥) ∈ 𝑆 ↔ (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))
15	12, 14	imbi12d 344	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) → (𝑈‘𝑥) ∈ 𝑆) ↔ ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆)))
16		sseq1 4006	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ⊆ 𝐴 ↔ 𝑋 ⊆ 𝐴))
17	16	anbi2d 629	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) ↔ (𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴)))
18		fveq2 6888	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑈‘𝑥) = (𝑈‘𝑋))
19	18	eleq1d 2818	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑈‘𝑥) ∈ 𝑆 ↔ (𝑈‘𝑋) ∈ 𝑆))
20	17, 19	imbi12d 344	. . . 4 ⊢ (𝑥 = 𝑋 → (((𝐾 ∈ HL ∧ 𝑥 ⊆ 𝐴) → (𝑈‘𝑥) ∈ 𝑆) ↔ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ∈ 𝑆)))
21		pclfincl.c	. . . . . . 7 ⊢ 𝑈 = (PCl‘𝐾)
22	21	pcl0N 38781	. . . . . 6 ⊢ (𝐾 ∈ HL → (𝑈‘∅) = ∅)
23		pclfincl.s	. . . . . . 7 ⊢ 𝑆 = (PSubCl‘𝐾)
24	23	0psubclN 38802	. . . . . 6 ⊢ (𝐾 ∈ HL → ∅ ∈ 𝑆)
25	22, 24	eqeltrd 2833	. . . . 5 ⊢ (𝐾 ∈ HL → (𝑈‘∅) ∈ 𝑆)
26	25	adantr 481	. . . 4 ⊢ ((𝐾 ∈ HL ∧ ∅ ⊆ 𝐴) → (𝑈‘∅) ∈ 𝑆)
27		anass 469	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) ∧ 𝑧 ∈ 𝐴) ↔ (𝐾 ∈ HL ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴)))
28		vex 3478	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
29	28	snss 4788	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝐴 ↔ {𝑧} ⊆ 𝐴)
30	29	anbi2i 623	. . . . . . . . 9 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴) ↔ (𝑦 ⊆ 𝐴 ∧ {𝑧} ⊆ 𝐴))
31		unss 4183	. . . . . . . . 9 ⊢ ((𝑦 ⊆ 𝐴 ∧ {𝑧} ⊆ 𝐴) ↔ (𝑦 ∪ {𝑧}) ⊆ 𝐴)
32	30, 31	bitri 274	. . . . . . . 8 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴) ↔ (𝑦 ∪ {𝑧}) ⊆ 𝐴)
33	32	anbi2i 623	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴)) ↔ (𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴))
34	27, 33	bitr2i 275	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) ↔ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) ∧ 𝑧 ∈ 𝐴))
35		simpllr 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑦 = ∅)
36	35	uneq1d 4161	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ∪ {𝑧}) = (∅ ∪ {𝑧}))
37		uncom 4152	. . . . . . . . . . . . . . 15 ⊢ (∅ ∪ {𝑧}) = ({𝑧} ∪ ∅)
38		un0 4389	. . . . . . . . . . . . . . 15 ⊢ ({𝑧} ∪ ∅) = {𝑧}
39	37, 38	eqtri 2760	. . . . . . . . . . . . . 14 ⊢ (∅ ∪ {𝑧}) = {𝑧}
40	36, 39	eqtrdi 2788	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ∪ {𝑧}) = {𝑧})
41	40	fveq2d 6892	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) = (𝑈‘{𝑧}))
42		simplrl 775	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝐾 ∈ HL)
43		hlatl 38218	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat)
44	42, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝐾 ∈ AtLat)
45		simprr 771	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑧 ∈ 𝐴)
46		pclfincl.a	. . . . . . . . . . . . . . 15 ⊢ 𝐴 = (Atoms‘𝐾)
47		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (PSubSp‘𝐾) = (PSubSp‘𝐾)
48	46, 47	snatpsubN 38609	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ AtLat ∧ 𝑧 ∈ 𝐴) → {𝑧} ∈ (PSubSp‘𝐾))
49	44, 45, 48	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → {𝑧} ∈ (PSubSp‘𝐾))
50	47, 21	pclidN 38755	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ {𝑧} ∈ (PSubSp‘𝐾)) → (𝑈‘{𝑧}) = {𝑧})
51	42, 49, 50	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘{𝑧}) = {𝑧})
52	41, 51	eqtrd 2772	. . . . . . . . . . 11 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) = {𝑧})
53	46, 23	atpsubclN 38804	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑧 ∈ 𝐴) → {𝑧} ∈ 𝑆)
54	42, 45, 53	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → {𝑧} ∈ 𝑆)
55	52, 54	eqeltrd 2833	. . . . . . . . . 10 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 = ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆)
56	55	exp43 437	. . . . . . . . 9 ⊢ ((𝑦 ∈ Fin ∧ 𝑦 = ∅) → ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → ((𝑈‘𝑦) ∈ 𝑆 → (𝑧 ∈ 𝐴 → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))))
57		simplrl 775	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝐾 ∈ HL)
58	46, 21	pclssidN 38754	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → 𝑦 ⊆ (𝑈‘𝑦))
59	58	ad2antlr 725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑦 ⊆ (𝑈‘𝑦))
60		unss1 4178	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ (𝑈‘𝑦) → (𝑦 ∪ {𝑧}) ⊆ ((𝑈‘𝑦) ∪ {𝑧}))
61	59, 60	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ∪ {𝑧}) ⊆ ((𝑈‘𝑦) ∪ {𝑧}))
62		simprl 769	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘𝑦) ∈ 𝑆)
63	46, 23	psubclssatN 38800	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ HL ∧ (𝑈‘𝑦) ∈ 𝑆) → (𝑈‘𝑦) ⊆ 𝐴)
64	57, 62, 63	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘𝑦) ⊆ 𝐴)
65		snssi 4810	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 ∈ 𝐴 → {𝑧} ⊆ 𝐴)
66	65	ad2antll 727	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → {𝑧} ⊆ 𝐴)
67		eqid 2732	. . . . . . . . . . . . . . . . 17 ⊢ (+_𝑃‘𝐾) = (+_𝑃‘𝐾)
68	46, 67	paddunssN 38667	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑈‘𝑦) ⊆ 𝐴 ∧ {𝑧} ⊆ 𝐴) → ((𝑈‘𝑦) ∪ {𝑧}) ⊆ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
69	57, 64, 66, 68	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦) ∪ {𝑧}) ⊆ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
70	61, 69	sstrd 3991	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ∪ {𝑧}) ⊆ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
71	46, 67	paddssat 38673	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑈‘𝑦) ⊆ 𝐴 ∧ {𝑧} ⊆ 𝐴) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ⊆ 𝐴)
72	57, 64, 66, 71	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ⊆ 𝐴)
73	46, 21	pclssN 38753	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∧ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ⊆ 𝐴) → (𝑈‘(𝑦 ∪ {𝑧})) ⊆ (𝑈‘((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧})))
74	57, 70, 72, 73	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) ⊆ (𝑈‘((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧})))
75		simprr 771	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑧 ∈ 𝐴)
76	46, 67, 23	paddatclN 38808	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ 𝑆)
77	57, 62, 75, 76	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ 𝑆)
78	47, 23	psubclsubN 38799	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ 𝑆) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ (PSubSp‘𝐾))
79	57, 77, 78	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ (PSubSp‘𝐾))
80	47, 21	pclidN 38755	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ∈ (PSubSp‘𝐾)) → (𝑈‘((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧})) = ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
81	57, 79, 80	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧})) = ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
82	74, 81	sseqtrd 4021	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) ⊆ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
83	57	hllatd 38222	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝐾 ∈ Lat)
84		simpllr 774	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑦 ≠ ∅)
85	46, 21	pcl0bN 38782	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → ((𝑈‘𝑦) = ∅ ↔ 𝑦 = ∅))
86	85	ad2antlr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦) = ∅ ↔ 𝑦 = ∅))
87	86	necon3bid 2985	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦) ≠ ∅ ↔ 𝑦 ≠ ∅))
88	84, 87	mpbird 256	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘𝑦) ≠ ∅)
89		eqid 2732	. . . . . . . . . . . . . . . . . 18 ⊢ (le‘𝐾) = (le‘𝐾)
90		eqid 2732	. . . . . . . . . . . . . . . . . 18 ⊢ (join‘𝐾) = (join‘𝐾)
91	89, 90, 46, 67	elpaddat 38663	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ Lat ∧ (𝑈‘𝑦) ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝑈‘𝑦) ≠ ∅) → (𝑞 ∈ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ↔ (𝑞 ∈ 𝐴 ∧ ∃𝑝 ∈ (𝑈‘𝑦)𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧))))
92	83, 64, 75, 88, 91	syl31anc 1373	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ↔ (𝑞 ∈ 𝐴 ∧ ∃𝑝 ∈ (𝑈‘𝑦)𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧))))
93		simp1rl 1238	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → 𝐾 ∈ HL)
94	93	3ad2ant1 1133	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) → 𝐾 ∈ HL)
95	94	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝐾 ∈ HL)
96		simprl 769	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑤 ∈ (PSubSp‘𝐾))
97		simpl13 1250	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑞 ∈ 𝐴)
98		unss 4183	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑦 ⊆ 𝑤 ∧ {𝑧} ⊆ 𝑤) ↔ (𝑦 ∪ {𝑧}) ⊆ 𝑤)
99		simpl 483	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑦 ⊆ 𝑤 ∧ {𝑧} ⊆ 𝑤) → 𝑦 ⊆ 𝑤)
100	98, 99	sylbir 234	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑦 ⊆ 𝑤)
101	100	ad2antll 727	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑦 ⊆ 𝑤)
102		simpl2 1192	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑝 ∈ (𝑈‘𝑦))
103	47, 21	elpcliN 38752	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝑤 ∧ 𝑤 ∈ (PSubSp‘𝐾)) ∧ 𝑝 ∈ (𝑈‘𝑦)) → 𝑝 ∈ 𝑤)
104	95, 101, 96, 102, 103	syl31anc 1373	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑝 ∈ 𝑤)
105	28	snss 4788	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑧 ∈ 𝑤 ↔ {𝑧} ⊆ 𝑤)
106	105	biimpri 227	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ({𝑧} ⊆ 𝑤 → 𝑧 ∈ 𝑤)
107	106	adantl 482	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑦 ⊆ 𝑤 ∧ {𝑧} ⊆ 𝑤) → 𝑧 ∈ 𝑤)
108	98, 107	sylbir 234	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑧 ∈ 𝑤)
109	108	ad2antll 727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑧 ∈ 𝑤)
110		simpl3 1193	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧))
111	89, 90, 46, 47	psubspi2N 38607	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐾 ∈ HL ∧ 𝑤 ∈ (PSubSp‘𝐾) ∧ 𝑞 ∈ 𝐴) ∧ (𝑝 ∈ 𝑤 ∧ 𝑧 ∈ 𝑤 ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧))) → 𝑞 ∈ 𝑤)
112	95, 96, 97, 104, 109, 110, 111	syl33anc 1385	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) ∧ 𝑝 ∈ (𝑈‘𝑦) ∧ 𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) ∧ (𝑤 ∈ (PSubSp‘𝐾) ∧ (𝑦 ∪ {𝑧}) ⊆ 𝑤)) → 𝑞 ∈ 𝑤)
113	112	exp520 1357	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → (𝑝 ∈ (𝑈‘𝑦) → (𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧) → (𝑤 ∈ (PSubSp‘𝐾) → ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤)))))
114	113	rexlimdv 3153	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → (∃𝑝 ∈ (𝑈‘𝑦)𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧) → (𝑤 ∈ (PSubSp‘𝐾) → ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤))))
115	114	3expia 1121	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ 𝐴 → (∃𝑝 ∈ (𝑈‘𝑦)𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧) → (𝑤 ∈ (PSubSp‘𝐾) → ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤)))))
116	115	impd 411	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑞 ∈ 𝐴 ∧ ∃𝑝 ∈ (𝑈‘𝑦)𝑞(le‘𝐾)(𝑝(join‘𝐾)𝑧)) → (𝑤 ∈ (PSubSp‘𝐾) → ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤))))
117	92, 116	sylbid 239	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) → (𝑤 ∈ (PSubSp‘𝐾) → ((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤))))
118	117	ralrimdv 3152	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) → ∀𝑤 ∈ (PSubSp‘𝐾)((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤)))
119		simplrr 776	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → 𝑦 ⊆ 𝐴)
120	119, 75	jca 512	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ 𝐴))
121	120, 32	sylib 217	. . . . . . . . . . . . . . 15 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑦 ∪ {𝑧}) ⊆ 𝐴)
122		vex 3478	. . . . . . . . . . . . . . . 16 ⊢ 𝑞 ∈ V
123	46, 47, 21, 122	elpclN 38751	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (𝑞 ∈ (𝑈‘(𝑦 ∪ {𝑧})) ↔ ∀𝑤 ∈ (PSubSp‘𝐾)((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤)))
124	57, 121, 123	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ (𝑈‘(𝑦 ∪ {𝑧})) ↔ ∀𝑤 ∈ (PSubSp‘𝐾)((𝑦 ∪ {𝑧}) ⊆ 𝑤 → 𝑞 ∈ 𝑤)))
125	118, 124	sylibrd 258	. . . . . . . . . . . . 13 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑞 ∈ ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) → 𝑞 ∈ (𝑈‘(𝑦 ∪ {𝑧}))))
126	125	ssrdv 3987	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}) ⊆ (𝑈‘(𝑦 ∪ {𝑧})))
127	82, 126	eqssd 3998	. . . . . . . . . . 11 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) = ((𝑈‘𝑦)(+_𝑃‘𝐾){𝑧}))
128	127, 77	eqeltrd 2833	. . . . . . . . . 10 ⊢ ((((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) ∧ (𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴)) ∧ ((𝑈‘𝑦) ∈ 𝑆 ∧ 𝑧 ∈ 𝐴)) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆)
129	128	exp43 437	. . . . . . . . 9 ⊢ ((𝑦 ∈ Fin ∧ 𝑦 ≠ ∅) → ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → ((𝑈‘𝑦) ∈ 𝑆 → (𝑧 ∈ 𝐴 → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))))
130	56, 129	pm2.61dane 3029	. . . . . . . 8 ⊢ (𝑦 ∈ Fin → ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → ((𝑈‘𝑦) ∈ 𝑆 → (𝑧 ∈ 𝐴 → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))))
131	130	a2d 29	. . . . . . 7 ⊢ (𝑦 ∈ Fin → (((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑈‘𝑦) ∈ 𝑆) → ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑧 ∈ 𝐴 → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))))
132	131	imp4b 422	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑈‘𝑦) ∈ 𝑆)) → (((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) ∧ 𝑧 ∈ 𝐴) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))
133	34, 132	biimtrid 241	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ ((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑈‘𝑦) ∈ 𝑆)) → ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆))
134	133	ex 413	. . . 4 ⊢ (𝑦 ∈ Fin → (((𝐾 ∈ HL ∧ 𝑦 ⊆ 𝐴) → (𝑈‘𝑦) ∈ 𝑆) → ((𝐾 ∈ HL ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (𝑈‘(𝑦 ∪ {𝑧})) ∈ 𝑆)))
135	5, 10, 15, 20, 26, 134	findcard2 9160	. . 3 ⊢ (𝑋 ∈ Fin → ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ∈ 𝑆))
136	135	3impib 1116	. 2 ⊢ ((𝑋 ∈ Fin ∧ 𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) ∈ 𝑆)
137	136	3coml 1127	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑋 ∈ Fin) → (𝑈‘𝑋) ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ∪ cun 3945 ⊆ wss 3947 ∅c0 4321 {csn 4627 class class class wbr 5147 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 lecple 17200 joincjn 18260 Latclat 18380 Atomscatm 38121 AtLatcal 38122 HLchlt 38208 PSubSpcpsubsp 38355 +_𝑃cpadd 38654 PClcpclN 38746 PSubClcpscN 38793

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-en 8936 df-fin 8939 df-proset 18244 df-poset 18262 df-plt 18279 df-lub 18295 df-glb 18296 df-join 18297 df-meet 18298 df-p0 18374 df-p1 18375 df-lat 18381 df-clat 18448 df-oposet 38034 df-ol 38036 df-oml 38037 df-covers 38124 df-ats 38125 df-atl 38156 df-cvlat 38180 df-hlat 38209 df-psubsp 38362 df-pmap 38363 df-padd 38655 df-pclN 38747 df-polarityN 38762 df-psubclN 38794

This theorem is referenced by: (None)

W3C validator