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 41659

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 41653	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
4	3	adantr 481	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
5		f1ofn 6768	. . . . . 6 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼 Fn dom 𝐼)
6	4, 5	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼 Fn dom 𝐼)
7		cnvimass 6034	. . . . 5 ⊢ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼
8		fnssres 6608	. . . . 5 ⊢ ((𝐼 Fn dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ⊆ dom 𝐼) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
9	6, 7, 8	sylancl 592	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆))
10		fniinfv 6905	. . . 4 ⊢ ((𝐼 ↾ (^◡𝐼 “ 𝑆)) Fn (^◡𝐼 “ 𝑆) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
11	9, 10	syl 17	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)))
12		df-ima 5631	. . . . 5 ⊢ (𝐼 “ (^◡𝐼 “ 𝑆)) = ran (𝐼 ↾ (^◡𝐼 “ 𝑆))
13		f1ofo 6774	. . . . . . . 8 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼:dom 𝐼–onto→ran 𝐼)
14	3, 13	syl 17	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–onto→ran 𝐼)
15	14	adantr 481	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–onto→ran 𝐼)
16		simprl 776	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ⊆ ran 𝐼)
17		foimacnv 6784	. . . . . 6 ⊢ ((𝐼:dom 𝐼–onto→ran 𝐼 ∧ 𝑆 ⊆ ran 𝐼) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
18	15, 16, 17	syl2anc 590	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 “ (^◡𝐼 “ 𝑆)) = 𝑆)
19	12, 18	eqtr3id 2788	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = 𝑆)
20	19	inteqd 4882	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ ran (𝐼 ↾ (^◡𝐼 “ 𝑆)) = ∩ 𝑆)
21	11, 20	eqtrd 2774	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑆)
22		simpl 483	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
23	7	a1i 11	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ dom 𝐼)
24		simprr 778	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ≠ ∅)
25		n0 4281	. . . . . . 7 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑆)
26	24, 25	sylib 219	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ 𝑆)
27	16	sselda 3915	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ran 𝐼)
28	3	ad2antrr 732	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
29	28, 5	syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼 Fn dom 𝐼)
30		fvelrnb 6887	. . . . . . . . 9 ⊢ (𝐼 Fn dom 𝐼 → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
32	27, 31	mpbid 233	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦)
33		f1ofun 6769	. . . . . . . . . . . . . . . 16 ⊢ (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → Fun 𝐼)
34	3, 33	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → Fun 𝐼)
35	34	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → Fun 𝐼)
36		fvimacnv 6994	. . . . . . . . . . . . . 14 ⊢ ((Fun 𝐼 ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
37	35, 36	sylan 586	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (^◡𝐼 “ 𝑆)))
38		ne0i 4269	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (^◡𝐼 “ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
39	37, 38	biimtrdi 254	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅))
40	39	ex 413	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) ∈ 𝑆 → (^◡𝐼 “ 𝑆) ≠ ∅)))
41		eleq1 2827	. . . . . . . . . . . . 13 ⊢ ((𝐼‘𝑥) = 𝑦 → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
42	41	biimprd 249	. . . . . . . . . . . 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 407	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅)))
47	46	rexlimdv 3138	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦 → (^◡𝐼 “ 𝑆) ≠ ∅))
48	32, 47	mpd 15	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (^◡𝐼 “ 𝑆) ≠ ∅)
49	26, 48	exlimddv 1942	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ≠ ∅)
50		eqid 2739	. . . . . 6 ⊢ (glb‘𝐾) = (glb‘𝐾)
51	50, 1, 2	dibglbN 41658	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((^◡𝐼 “ 𝑆) ⊆ dom 𝐼 ∧ (^◡𝐼 “ 𝑆) ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
52	22, 23, 49, 51	syl12anc 842	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦))
53		fvres 6846	. . . . 5 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → ((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = (𝐼‘𝑦))
54	53	iineq2i 4944	. . . 4 ⊢ ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)(𝐼‘𝑦)
55	52, 54	eqtr4di 2792	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦))
56		hlclat 39850	. . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
57	56	ad2antrr 732	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐾 ∈ CLat)
58		eqid 2739	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
59		eqid 2739	. . . . . . . . . 10 ⊢ (le‘𝐾) = (le‘𝐾)
60	58, 59, 1, 2	dibdmN 41649	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
61		ssrab2 4011	. . . . . . . . 9 ⊢ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} ⊆ (Base‘𝐾)
62	60, 61	eqsstrdi 3959	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 ⊆ (Base‘𝐾))
63	62	adantr 481	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 ⊆ (Base‘𝐾))
64	7, 63	sstrid 3926	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
65	58, 50	clatglbcl 18462	. . . . . 6 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
66	57, 64, 65	syl2anc 590	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
67		n0 4281	. . . . . . 7 ⊢ ((^◡𝐼 “ 𝑆) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
68	49, 67	sylib 219	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ (^◡𝐼 “ 𝑆))
69		hllat 39855	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
70	69	ad3antrrr 736	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ Lat)
71	66	adantr 481	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
72	64	sselda 3915	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (Base‘𝐾))
73	58, 1	lhpbase 40490	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
74	73	ad3antlr 737	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑊 ∈ (Base‘𝐾))
75	56	ad3antrrr 736	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝐾 ∈ CLat)
76	60	adantr 481	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
77	7, 76	sseqtrid 3957	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
78	77, 61	sstrdi 3927	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
79	78	adantr 481	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
80		simpr 485	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ (^◡𝐼 “ 𝑆))
81	58, 59, 50	clatglble 18474	. . . . . . . 8 ⊢ ((𝐾 ∈ CLat ∧ (^◡𝐼 “ 𝑆) ⊆ (Base‘𝐾) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
82	75, 79, 80, 81	syl3anc 1379	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
83	7	sseli 3911	. . . . . . . . . 10 ⊢ (𝑦 ∈ (^◡𝐼 “ 𝑆) → 𝑦 ∈ dom 𝐼)
84	83	adantl 482	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦 ∈ dom 𝐼)
85	58, 59, 1, 2	dibeldmN 41650	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
86	85	ad2antrr 732	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
87	84, 86	mpbid 233	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))
88	87	simprd 496	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → 𝑦(le‘𝐾)𝑊)
89	58, 59, 70, 71, 72, 74, 82, 88	lattrd 18403	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (^◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
90	68, 89	exlimddv 1942	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
91	58, 59, 1, 2	dibeldmN 41650	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
92	91	adantr 481	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
93	66, 90, 92	mpbir2and 719	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼)
94	1, 2	dibclN 41654	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((glb‘𝐾)‘(^◡𝐼 “ 𝑆)) ∈ dom 𝐼) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
95	93, 94	syldan 597	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(^◡𝐼 “ 𝑆))) ∈ ran 𝐼)
96	55, 95	eqeltrrd 2840	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (^◡𝐼 “ 𝑆)((𝐼 ↾ (^◡𝐼 “ 𝑆))‘𝑦) ∈ ran 𝐼)
97	21, 96	eqeltrrd 2840	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∃wex 1786 ∈ wcel 2119 ≠ wne 2934 ∃wrex 3063 {crab 3391 ⊆ wss 3883 ∅c0 4261 ∩ cint 4877 ∩ ciin 4922 class class class wbr 5072 ^◡ccnv 5617 dom cdm 5618 ran crn 5619 ↾ cres 5620 “ cima 5621 Fun wfun 6479 Fn wfn 6480 –onto→wfo 6483 –1-1-onto→wf1o 6484 ‘cfv 6485 Basecbs 17170 lecple 17218 glbcglb 18267 Latclat 18388 CLatccla 18455 HLchlt 39842 LHypclh 40476 DIsoBcdib 41630

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-riotaBAD 39445

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-undef 8213 df-map 8765 df-proset 18251 df-poset 18270 df-plt 18285 df-lub 18301 df-glb 18302 df-join 18303 df-meet 18304 df-p0 18380 df-p1 18381 df-lat 18389 df-clat 18456 df-oposet 39668 df-ol 39670 df-oml 39671 df-covers 39758 df-ats 39759 df-atl 39790 df-cvlat 39814 df-hlat 39843 df-llines 39990 df-lplanes 39991 df-lvols 39992 df-lines 39993 df-psubsp 39995 df-pmap 39996 df-padd 40288 df-lhyp 40480 df-laut 40481 df-ldil 40596 df-ltrn 40597 df-trl 40651 df-disoa 41521 df-dib 41631

This theorem is referenced by: (None)

W3C validator