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

Theorem dibintclN 42361
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.
StepHypRef Expression
1 dibintcl.h . . . . . . . 8 𝐻 = (LHyp‘𝐾)
2 dibintcl.i . . . . . . . 8 𝐼 = ((DIsoB‘𝐾)‘𝑊)
31, 2dibf11N 42355 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
43adantr 486 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
5 f1ofn 6830 . . . . . 6 (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼 Fn dom 𝐼)
64, 5syl 18 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼 Fn dom 𝐼)
7 cnvimass 6201 . . . . 5 (◡𝐼 “ 𝑆) ⊆ dom 𝐼
8 fnssres 6667 . . . . 5 ((𝐼 Fn dom 𝐼 ∧ (◡𝐼 “ 𝑆) ⊆ dom 𝐼) → (𝐼 ↾ (◡𝐼 “ 𝑆)) Fn (◡𝐼 “ 𝑆))
96, 7, 8sylancl 598 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 ↾ (◡𝐼 “ 𝑆)) Fn (◡𝐼 “ 𝑆))
10 fniinfv 6968 . . . 4 ((𝐼 ↾ (◡𝐼 “ 𝑆)) Fn (◡𝐼 “ 𝑆) → ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (◡𝐼 “ 𝑆)))
119, 10syl 18 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) = ∩ ran (𝐼 ↾ (◡𝐼 “ 𝑆)))
12 df-ima 5664 . . . . 5 (𝐼 “ (◡𝐼 “ 𝑆)) = ran (𝐼 ↾ (◡𝐼 “ 𝑆))
13 f1ofo 6837 . . . . . . . 8 (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → 𝐼:dom 𝐼–onto→ran 𝐼)
143, 13syl 18 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–onto→ran 𝐼)
1514adantr 486 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐼:dom 𝐼–onto→ran 𝐼)
16 simprl 783 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ⊆ ran 𝐼)
17 foimacnv 6847 . . . . . 6 ((𝐼:dom 𝐼–onto→ran 𝐼 ∧ 𝑆 ⊆ ran 𝐼) → (𝐼 “ (◡𝐼 “ 𝑆)) = 𝑆)
1815, 16, 17syl2anc 596 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼 “ (◡𝐼 “ 𝑆)) = 𝑆)
1912, 18eqtr3id 2809 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ran (𝐼 ↾ (◡𝐼 “ 𝑆)) = 𝑆)
2019inteqd 4911 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ ran (𝐼 ↾ (◡𝐼 “ 𝑆)) = ∩ 𝑆)
2111, 20eqtrd 2795 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑆)
22 simpl 488 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
237a1i 11 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (◡𝐼 “ 𝑆) ⊆ dom 𝐼)
24 simprr 785 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝑆 ≠ ∅)
25 n0 4299 . . . . . . 7 (𝑆 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑆)
2624, 25sylib 221 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ 𝑆)
2716sselda 3909 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ran 𝐼)
283ad2antrr 739 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼)
2928, 5syl 18 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → 𝐼 Fn dom 𝐼)
30 fvelrnb 6950 . . . . . . . . 9 (𝐼 Fn dom 𝐼 → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
3129, 30syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑦 ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦))
3227, 31mpbid 235 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦)
33 f1ofun 6831 . . . . . . . . . . . . . . . 16 (𝐼:dom 𝐼–1-1-onto→ran 𝐼 → Fun 𝐼)
343, 33syl 18 . . . . . . . . . . . . . . 15 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → Fun 𝐼)
3534adantr 486 . . . . . . . . . . . . . 14 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → Fun 𝐼)
36 fvimacnv 7057 . . . . . . . . . . . . . 14 ((Fun 𝐼 ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (◡𝐼 “ 𝑆)))
3735, 36sylan 592 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑥 ∈ (◡𝐼 “ 𝑆)))
38 ne0i 4286 . . . . . . . . . . . . 13 (𝑥 ∈ (◡𝐼 “ 𝑆) → (◡𝐼 “ 𝑆) ≠ ∅)
3937, 38biimtrdi 256 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑥 ∈ dom 𝐼) → ((𝐼‘𝑥) ∈ 𝑆 → (◡𝐼 “ 𝑆) ≠ ∅))
4039ex 418 . . . . . . . . . . 11 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) ∈ 𝑆 → (◡𝐼 “ 𝑆) ≠ ∅)))
41 eleq1 2848 . . . . . . . . . . . . 13 ((𝐼‘𝑥) = 𝑦 → ((𝐼‘𝑥) ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
4241biimprd 251 . . . . . . . . . . . 12 ((𝐼‘𝑥) = 𝑦 → (𝑦 ∈ 𝑆 → (𝐼‘𝑥) ∈ 𝑆))
4342imim1d 83 . . . . . . . . . . 11 ((𝐼‘𝑥) = 𝑦 → (((𝐼‘𝑥) ∈ 𝑆 → (◡𝐼 “ 𝑆) ≠ ∅) → (𝑦 ∈ 𝑆 → (◡𝐼 “ 𝑆) ≠ ∅)))
4440, 43syl9 78 . . . . . . . . . 10 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((𝐼‘𝑥) = 𝑦 → (𝑥 ∈ dom 𝐼 → (𝑦 ∈ 𝑆 → (◡𝐼 “ 𝑆) ≠ ∅))))
4544com24 96 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝑦 ∈ 𝑆 → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (◡𝐼 “ 𝑆) ≠ ∅))))
4645imp 412 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (𝑥 ∈ dom 𝐼 → ((𝐼‘𝑥) = 𝑦 → (◡𝐼 “ 𝑆) ≠ ∅)))
4746rexlimdv 3161 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = 𝑦 → (◡𝐼 “ 𝑆) ≠ ∅))
4832, 47mpd 16 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ 𝑆) → (◡𝐼 “ 𝑆) ≠ ∅)
4926, 48exlimddv 1967 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (◡𝐼 “ 𝑆) ≠ ∅)
50 eqid 2760 . . . . . 6 (glb‘𝐾) = (glb‘𝐾)
5150, 1, 2dibglbN 42360 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((◡𝐼 “ 𝑆) ⊆ dom 𝐼 ∧ (◡𝐼 “ 𝑆) ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)(𝐼‘𝑦))
5222, 23, 49, 51syl12anc 850 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)(𝐼‘𝑦))
53 fvres 6909 . . . . 5 (𝑦 ∈ (◡𝐼 “ 𝑆) → ((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) = (𝐼‘𝑦))
5453iineq2i 4973 . . . 4 ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) = ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)(𝐼‘𝑦)
5552, 54eqtr4di 2813 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(◡𝐼 “ 𝑆))) = ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦))
56 hlclat 40552 . . . . . . 7 (𝐾 ∈ HL → 𝐾 ∈ CLat)
5756ad2antrr 739 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → 𝐾 ∈ CLat)
58 eqid 2760 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
59 eqid 2760 . . . . . . . . . 10 (le‘𝐾) = (le‘𝐾)
6058, 59, 1, 2dibdmN 42351 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
61 ssrab2 4004 . . . . . . . . 9 {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} ⊆ (Base‘𝐾)
6260, 61eqsstrdi 3953 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → dom 𝐼 ⊆ (Base‘𝐾))
6362adantr 486 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 ⊆ (Base‘𝐾))
647, 63sstrid 3920 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
6558, 50clatglbcl 18688 . . . . . 6 ((𝐾 ∈ CLat ∧ (◡𝐼 “ 𝑆) ⊆ (Base‘𝐾)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
6657, 64, 65syl2anc 596 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
67 n0 4299 . . . . . . 7 ((◡𝐼 “ 𝑆) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (◡𝐼 “ 𝑆))
6849, 67sylib 221 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∃𝑦 𝑦 ∈ (◡𝐼 “ 𝑆))
69 hllat 40557 . . . . . . . 8 (𝐾 ∈ HL → 𝐾 ∈ Lat)
7069ad3antrrr 743 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝐾 ∈ Lat)
7166adantr 486 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ (Base‘𝐾))
7264sselda 3909 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝑦 ∈ (Base‘𝐾))
7358, 1lhpbase 41192 . . . . . . . 8 (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
7473ad3antlr 744 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝑊 ∈ (Base‘𝐾))
7556ad3antrrr 743 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝐾 ∈ CLat)
7660adantr 486 . . . . . . . . . . 11 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → dom 𝐼 = {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
777, 76sseqtrid 3951 . . . . . . . . . 10 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (◡𝐼 “ 𝑆) ⊆ {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
7877, 61sstrdi 3921 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
7978adantr 486 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → (◡𝐼 “ 𝑆) ⊆ (Base‘𝐾))
80 simpr 490 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝑦 ∈ (◡𝐼 “ 𝑆))
8158, 59, 50clatglble 18700 . . . . . . . 8 ((𝐾 ∈ CLat ∧ (◡𝐼 “ 𝑆) ⊆ (Base‘𝐾) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
8275, 79, 80, 81syl3anc 1398 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑦)
837sseli 3905 . . . . . . . . . 10 (𝑦 ∈ (◡𝐼 “ 𝑆) → 𝑦 ∈ dom 𝐼)
8483adantl 487 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝑦 ∈ dom 𝐼)
8558, 59, 1, 2dibeldmN 42352 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
8685ad2antrr 739 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
8784, 86mpbid 235 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))
8887simprd 501 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → 𝑦(le‘𝐾)𝑊)
8958, 59, 70, 71, 72, 74, 82, 88lattrd 18629 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) ∧ 𝑦 ∈ (◡𝐼 “ 𝑆)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
9068, 89exlimddv 1967 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑊)
9158, 59, 1, 2dibeldmN 42352 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
9291adantr 486 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ dom 𝐼 ↔ (((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ (Base‘𝐾) ∧ ((glb‘𝐾)‘(◡𝐼 “ 𝑆))(le‘𝐾)𝑊)))
9366, 90, 92mpbir2and 726 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ dom 𝐼)
941, 2dibclN 42356 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((glb‘𝐾)‘(◡𝐼 “ 𝑆)) ∈ dom 𝐼) → (𝐼‘((glb‘𝐾)‘(◡𝐼 “ 𝑆))) ∈ ran 𝐼)
9593, 94syldan 603 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘((glb‘𝐾)‘(◡𝐼 “ 𝑆))) ∈ ran 𝐼)
9655, 95eqeltrrd 2861 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑦 ∈ (◡𝐼 “ 𝑆)((𝐼 ↾ (◡𝐼 “ 𝑆))‘𝑦) ∈ ran 𝐼)
9721, 96eqeltrrd 2861 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  {crab 3412   ⊆ wss 3896  ∅c0 4277  ∩ cint 4906  ∩ ciin 4951   class class class wbr 5102  ◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Fun wfun 6537   Fn wfn 6538  –onto→wfo 6541  –1-1-onto→wf1o 6542  ‘cfv 6543  Basecbs 17396  lecple 17444  glbcglb 18493  Latclat 18614  CLatccla 18681  HLchlt 40544  LHypclh 41178  DIsoBcdib 42332
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-riotaBAD 40147
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-undef 8298  df-map 8857  df-proset 18477  df-poset 18496  df-plt 18511  df-lub 18527  df-glb 18528  df-join 18529  df-meet 18530  df-p0 18606  df-p1 18607  df-lat 18615  df-clat 18682  df-oposet 40370  df-ol 40372  df-oml 40373  df-covers 40460  df-ats 40461  df-atl 40492  df-cvlat 40516  df-hlat 40545  df-llines 40692  df-lplanes 40693  df-lvols 40694  df-lines 40695  df-psubsp 40697  df-pmap 40698  df-padd 40990  df-lhyp 41182  df-laut 41183  df-ldil 41298  df-ltrn 41299  df-trl 41353  df-disoa 42223  df-dib 42333
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator