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 41941

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 41935	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
4	3	adantr 485	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
5		f1ofn 6821	. . . . . 6 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼 Fn dom 𝐼)
6	4, 5	syl 18	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼 Fn dom 𝐼)
7		cnvimass 6084	. . . . 5 ⊢ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼
8		fnssres 6658	. . . . 5 ⊢ ((𝐼 Fn dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
9	6, 7, 8	sylancl 597	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
10		fniinfv 6959	. . . 4 ⊢ ((𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
11	9, 10	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
12		df-ima 5674	. . . . 5 ⊢ (𝐼 “ (^◡𝐼 “ 𝑆)) = ran (𝐼 ↾ (^◡𝐼 “ 𝑆))
13		f1ofo 6828	. . . . . . . 8 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼:dom 𝐼–onto→ran 𝐼)
14	3, 13	syl 18	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–onto→ran 𝐼)
15	14	adantr 485	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–onto→ran 𝐼)
16		simprl 782	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ⊆ ran 𝐼)
17		foimacnv 6838	. . . . . 6 ⊢ ((𝐼:dom 𝐼–onto→ran 𝐼 ∧ 𝑆 ⊆ ran 𝐼) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
18	15, 16, 17	syl2anc 595	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
19	12, 18	eqtr3id 2812	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = 𝑆)
20	19	inteqd 4917	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = ∩ 𝑆)
21	11, 20	eqtrd 2798	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑆)
22		simpl 487	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
23	7	a1i 11	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ dom 𝐼)
24		simprr 784	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ≠ ∅)
25		n0 4307	. . . . . . 7 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑆)
26	24, 25	sylib 221	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ 𝑆)
27	16	sselda 3937	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ran 𝐼)
28	3	ad2antrr 738	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
29	28, 5	syl 18	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼 Fn dom 𝐼)
30		fvelrnb 6941	. . . . . . . . 9 ⊢ (𝐼 Fn dom 𝐼 → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
31	29, 30	syl 18	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
32	27, 31	mpbid 235	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦)
33		f1ofun 6822	. . . . . . . . . . . . . . . 16 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → Fun 𝐼)
34	3, 33	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → Fun 𝐼)
35	34	adantr 485	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → Fun 𝐼)
36		fvimacnv 7048	. . . . . . . . . . . . . 14 ⊢ ((Fun 𝐼 ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
37	35, 36	sylan 591	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
38		ne0i 4294	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (^◡𝐼 “ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
39	37, 38	biimtrdi 256	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅))
40	39	ex 417	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅)))
41		eleq1 2851	. . . . . . . . . . . . 13 ⊢ ((𝐼‘𝑥) = 𝑦 → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
42	41	biimprd 251	. . . . . . . . . . . 12 ⊢ ((𝐼‘𝑥) = 𝑦 → (𝑦 ∈ 𝑆 → (𝐼‘𝑥) ∈ 𝑆))
43	42	imim1d 83	. . . . . . . . . . 11 ⊢ ((𝐼‘𝑥) = 𝑦 → (((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅) → (𝑦 ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅)))
44	40, 43	syl9 78	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((𝐼‘𝑥) = 𝑦 → (𝑥 ∈ dom 𝐼 → (𝑦 ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅))))
45	44	com24 96	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑦 ∈ 𝑆 → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅))))
46	45	imp 411	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅)))
47	46	rexlimdv 3164	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅))
48	32, 47	mpd 16	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
49	26, 48	exlimddv 1965	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ≠ ∅)
50		eqid 2763	. . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾)
51	50, 1, 2	dibglbN 41940	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((^◡𝐼 “ 𝑆) ⊆ dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
52	22, 23, 49, 51	syl12anc 849	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
53		fvres 6900	. . . . 5 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → ((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = (𝐼‘𝑦))
54	53	iineq2i 4979	. . . 4 ⊢ ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦)
55	52, 54	eqtr4di 2816	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦))
56		hlclat 40132	. . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
57	56	ad2antrr 738	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐾 ∈ CLat)
58		eqid 2763	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
59		eqid 2763	. . . . . . . . . 10 ⊢ (le‘𝐾) = (le‘𝐾)
60	58, 59, 1, 2	dibdmN 41931	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
61		ssrab2 4034	. . . . . . . . 9 ⊢ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} ⊆ (Base‘𝐾)
62	60, 61	eqsstrdi 3981	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 ⊆ (Base‘𝐾))
63	62	adantr 485	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 ⊆ (Base‘𝐾))
64	7, 63	sstrid 3948	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
65	58, 50	clatglbcl 18556	. . . . . 6 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
66	57, 64, 65	syl2anc 595	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
67		n0 4307	. . . . . . 7 ⊢ ((^◡𝐼 “ 𝑆) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
68	49, 67	sylib 221	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
69		hllat 40137	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
70	69	ad3antrrr 742	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ Lat)
71	66	adantr 485	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
72	64	sselda 3937	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (Base‘𝐾))
73	58, 1	lhpbase 40772	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
74	73	ad3antlr 743	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑊 ∈ (Base‘𝐾))
75	56	ad3antrrr 742	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ CLat)
76	60	adantr 485	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
77	7, 76	sseqtrid 3979	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
78	77, 61	sstrdi 3949	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
79	78	adantr 485	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
80		simpr 489	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (^◡𝐼 “ 𝑆))
81	58, 59, 50	clatglble 18568	. . . . . . . 8 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
82	75, 79, 80, 81	syl3anc 1398	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
83	7	sseli 3933	. . . . . . . . . 10 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → 𝑦 ∈ dom 𝐼)
84	83	adantl 486	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ dom 𝐼)
85	58, 59, 1, 2	dibeldmN 41932	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
86	85	ad2antrr 738	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
87	84, 86	mpbid 235	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))
88	87	simprd 500	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦(le‘𝐾)𝑊)
89	58, 59, 70, 71, 72, 74, 82, 88	lattrd 18497	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
90	68, 89	exlimddv 1965	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
91	58, 59, 1, 2	dibeldmN 41932	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
92	91	adantr 485	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
93	66, 90, 92	mpbir2and 725	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼)
94	1, 2	dibclN 41936	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
95	93, 94	syldan 602	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
96	55, 95	eqeltrrd 2864	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) ∈ ran 𝐼)
97	21, 96	eqeltrrd 2864	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3089 {crab 3416 ⊆ wss 3905 ∅c0 4286 ∩ cint 4912 ∩ ciin 4957 class class class wbr 5109 ^◡ccnv 5660 dom cdm 5661 ran crn 5662 ↾ cres 5663 “ cima 5664 Fun wfun 6530 Fn wfn 6531 –onto→wfo 6534 –1-1-onto→wf1o 6535 ‘cfv 6536 Basecbs 17264 lecple 17312 glbcglb 18361 Latclat 18482 CLatccla 18549 HLchlt 40124 LHypclh 40758 DIsoBcdib 41912

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-riotaBAD 39727

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-undef 8265 df-map 8822 df-proset 18345 df-poset 18364 df-plt 18379 df-lub 18395 df-glb 18396 df-join 18397 df-meet 18398 df-p0 18474 df-p1 18475 df-lat 18483 df-clat 18550 df-oposet 39950 df-ol 39952 df-oml 39953 df-covers 40040 df-ats 40041 df-atl 40072 df-cvlat 40096 df-hlat 40125 df-llines 40272 df-lplanes 40273 df-lvols 40274 df-lines 40275 df-psubsp 40277 df-pmap 40278 df-padd 40570 df-lhyp 40762 df-laut 40763 df-ldil 40878 df-ltrn 40879 df-trl 40933 df-disoa 41803 df-dib 41913

This theorem is referenced by: (None)

W3C validator