dibintclN - Mathbox for Norm Megill

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

Theorem dibintclN 41214

Description: The intersection of partial isomorphism B closed subspaces is a closed subspace. (Contributed by NM, 8-Mar-2014.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
dibintcl.h	⊢ 𝐻 = (LHyp‘𝐾)
dibintcl.i	⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
dibintclN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼)

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

Step	Hyp	Ref	Expression
1		dibintcl.h	. . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾)
2		dibintcl.i	. . . . . . . 8 ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊)
3	1, 2	dibf11N 41208	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
4	3	adantr 480	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
5		f1ofn 6764	. . . . . 6 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼 Fn dom 𝐼)
6	4, 5	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼 Fn dom 𝐼)
7		cnvimass 6030	. . . . 5 ⊢ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼
8		fnssres 6604	. . . . 5 ⊢ ((𝐼 Fn dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
9	6, 7, 8	sylancl 586	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
10		fniinfv 6900	. . . 4 ⊢ ((𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
11	9, 10	syl 17	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
12		df-ima 5627	. . . . 5 ⊢ (𝐼 “ (^◡𝐼 “ 𝑆)) = ran (𝐼 ↾ (^◡𝐼 “ 𝑆))
13		f1ofo 6770	. . . . . . . 8 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼:dom 𝐼–onto→ran 𝐼)
14	3, 13	syl 17	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–onto→ran 𝐼)
15	14	adantr 480	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–onto→ran 𝐼)
16		simprl 770	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ⊆ ran 𝐼)
17		foimacnv 6780	. . . . . 6 ⊢ ((𝐼:dom 𝐼–onto→ran 𝐼 ∧ 𝑆 ⊆ ran 𝐼) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
18	15, 16, 17	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
19	12, 18	eqtr3id 2780	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = 𝑆)
20	19	inteqd 4900	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = ∩ 𝑆)
21	11, 20	eqtrd 2766	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑆)
22		simpl 482	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
23	7	a1i 11	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ dom 𝐼)
24		simprr 772	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ≠ ∅)
25		n0 4300	. . . . . . 7 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑆)
26	24, 25	sylib 218	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ 𝑆)
27	16	sselda 3929	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ran 𝐼)
28	3	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
29	28, 5	syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼 Fn dom 𝐼)
30		fvelrnb 6882	. . . . . . . . 9 ⊢ (𝐼 Fn dom 𝐼 → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
32	27, 31	mpbid 232	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦)
33		f1ofun 6765	. . . . . . . . . . . . . . . 16 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → Fun 𝐼)
34	3, 33	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → Fun 𝐼)
35	34	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → Fun 𝐼)
36		fvimacnv 6986	. . . . . . . . . . . . . 14 ⊢ ((Fun 𝐼 ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
37	35, 36	sylan 580	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
38		ne0i 4288	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (^◡𝐼 “ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
39	37, 38	biimtrdi 253	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅))
40	39	ex 412	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅)))
41		eleq1 2819	. . . . . . . . . . . . 13 ⊢ ((𝐼‘𝑥) = 𝑦 → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
42	41	biimprd 248	. . . . . . . . . . . 12 ⊢ ((𝐼‘𝑥) = 𝑦 → (𝑦 ∈ 𝑆 → (𝐼‘𝑥) ∈ 𝑆))
43	42	imim1d 82	. . . . . . . . . . 11 ⊢ ((𝐼‘𝑥) = 𝑦 → (((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅) → (𝑦 ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅)))
44	40, 43	syl9 77	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((𝐼‘𝑥) = 𝑦 → (𝑥 ∈ dom 𝐼 → (𝑦 ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅))))
45	44	com24 95	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑦 ∈ 𝑆 → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅))))
46	45	imp 406	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅)))
47	46	rexlimdv 3131	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅))
48	32, 47	mpd 15	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
49	26, 48	exlimddv 1936	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ≠ ∅)
50		eqid 2731	. . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾)
51	50, 1, 2	dibglbN 41213	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((^◡𝐼 “ 𝑆) ⊆ dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
52	22, 23, 49, 51	syl12anc 836	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
53		fvres 6841	. . . . 5 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → ((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = (𝐼‘𝑦))
54	53	iineq2i 4962	. . . 4 ⊢ ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦)
55	52, 54	eqtr4di 2784	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦))
56		hlclat 39405	. . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
57	56	ad2antrr 726	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐾 ∈ CLat)
58		eqid 2731	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
59		eqid 2731	. . . . . . . . . 10 ⊢ (le‘𝐾) = (le‘𝐾)
60	58, 59, 1, 2	dibdmN 41204	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
61		ssrab2 4027	. . . . . . . . 9 ⊢ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} ⊆ (Base‘𝐾)
62	60, 61	eqsstrdi 3974	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 ⊆ (Base‘𝐾))
63	62	adantr 480	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 ⊆ (Base‘𝐾))
64	7, 63	sstrid 3941	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
65	58, 50	clatglbcl 18411	. . . . . 6 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
66	57, 64, 65	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
67		n0 4300	. . . . . . 7 ⊢ ((^◡𝐼 “ 𝑆) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
68	49, 67	sylib 218	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
69		hllat 39410	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
70	69	ad3antrrr 730	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ Lat)
71	66	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
72	64	sselda 3929	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (Base‘𝐾))
73	58, 1	lhpbase 40045	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
74	73	ad3antlr 731	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑊 ∈ (Base‘𝐾))
75	56	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ CLat)
76	60	adantr 480	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
77	7, 76	sseqtrid 3972	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
78	77, 61	sstrdi 3942	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
79	78	adantr 480	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
80		simpr 484	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (^◡𝐼 “ 𝑆))
81	58, 59, 50	clatglble 18423	. . . . . . . 8 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
82	75, 79, 80, 81	syl3anc 1373	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
83	7	sseli 3925	. . . . . . . . . 10 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → 𝑦 ∈ dom 𝐼)
84	83	adantl 481	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ dom 𝐼)
85	58, 59, 1, 2	dibeldmN 41205	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
86	85	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
87	84, 86	mpbid 232	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))
88	87	simprd 495	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦(le‘𝐾)𝑊)
89	58, 59, 70, 71, 72, 74, 82, 88	lattrd 18352	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
90	68, 89	exlimddv 1936	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
91	58, 59, 1, 2	dibeldmN 41205	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
92	91	adantr 480	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
93	66, 90, 92	mpbir2and 713	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼)
94	1, 2	dibclN 41209	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
95	93, 94	syldan 591	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
96	55, 95	eqeltrrd 2832	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) ∈ ran 𝐼)
97	21, 96	eqeltrrd 2832	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2111 ≠ wne 2928 ∃wrex 3056 {crab 3395 ⊆ wss 3897 ∅c0 4280 ∩ cint 4895 ∩ ciin 4940 class class class wbr 5089 ^◡ccnv 5613 dom cdm 5614 ran crn 5615 ↾ cres 5616 “ cima 5617 Fun wfun 6475 Fn wfn 6476 –onto→wfo 6479 –1-1-onto→wf1o 6480 ‘cfv 6481 Basecbs 17120 lecple 17168 glbcglb 18216 Latclat 18337 CLatccla 18404 HLchlt 39397 LHypclh 40031 DIsoBcdib 41185

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-riotaBAD 39000

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7921 df-2nd 7922 df-undef 8203 df-map 8752 df-proset 18200 df-poset 18219 df-plt 18234 df-lub 18250 df-glb 18251 df-join 18252 df-meet 18253 df-p0 18329 df-p1 18330 df-lat 18338 df-clat 18405 df-oposet 39223 df-ol 39225 df-oml 39226 df-covers 39313 df-ats 39314 df-atl 39345 df-cvlat 39369 df-hlat 39398 df-llines 39545 df-lplanes 39546 df-lvols 39547 df-lines 39548 df-psubsp 39550 df-pmap 39551 df-padd 39843 df-lhyp 40035 df-laut 40036 df-ldil 40151 df-ltrn 40152 df-trl 40206 df-disoa 41076 df-dib 41186

This theorem is referenced by: (None)

W3C validator