Theorem pmapglb2xN 40238

Description: The projective map of the GLB of a set of lattice elements. Index-set version of pmapglb2N 40237, where we read 𝑆 as 𝑆(𝑖). Extension of Theorem 15.5.2 of [MaedaMaeda] p. 62 that allows 𝐼 = ∅. (Contributed by NM, 21-Jan-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
pmapglb2.b	⊢ 𝐵 = (Base‘𝐾)
pmapglb2.g	⊢ 𝐺 = (glb‘𝐾)
pmapglb2.a	⊢ 𝐴 = (Atoms‘𝐾)
pmapglb2.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
pmapglb2xN	⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)))

Distinct variable groups:   𝐴,𝑖   𝑦,𝑖,𝐵   𝑖,𝐼,𝑦   𝑖,𝐾,𝑦   𝑦,𝑆

Allowed substitution hints:   𝐴(𝑦)   𝑆(𝑖)   𝐺(𝑦,𝑖)   𝑀(𝑦,𝑖)

Proof of Theorem pmapglb2xN

Step	Hyp	Ref	Expression
1		hlop 39828	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP)
2		pmapglb2.g	. . . . . . . 8 ⊢ 𝐺 = (glb‘𝐾)
3		eqid 2737	. . . . . . . 8 ⊢ (1.‘𝐾) = (1.‘𝐾)
4	2, 3	glb0N 39659	. . . . . . 7 ⊢ (𝐾 ∈ OP → (𝐺‘∅) = (1.‘𝐾))
5	4	fveq2d 6840	. . . . . 6 ⊢ (𝐾 ∈ OP → (𝑀‘(𝐺‘∅)) = (𝑀‘(1.‘𝐾)))
6		pmapglb2.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
7		pmapglb2.m	. . . . . . 7 ⊢ 𝑀 = (pmap‘𝐾)
8	3, 6, 7	pmap1N 40233	. . . . . 6 ⊢ (𝐾 ∈ OP → (𝑀‘(1.‘𝐾)) = 𝐴)
9	5, 8	eqtrd 2772	. . . . 5 ⊢ (𝐾 ∈ OP → (𝑀‘(𝐺‘∅)) = 𝐴)
10	1, 9	syl 17	. . . 4 ⊢ (𝐾 ∈ HL → (𝑀‘(𝐺‘∅)) = 𝐴)
11		rexeq 3292	. . . . . . . . 9 ⊢ (𝐼 = ∅ → (∃𝑖 ∈ 𝐼 𝑦 = 𝑆 ↔ ∃𝑖 ∈ ∅ 𝑦 = 𝑆))
12	11	abbidv 2803	. . . . . . . 8 ⊢ (𝐼 = ∅ → {𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆} = {𝑦 ∣ ∃𝑖 ∈ ∅ 𝑦 = 𝑆})
13		rex0 4301	. . . . . . . . 9 ⊢ ¬ ∃𝑖 ∈ ∅ 𝑦 = 𝑆
14	13	abf 4347	. . . . . . . 8 ⊢ {𝑦 ∣ ∃𝑖 ∈ ∅ 𝑦 = 𝑆} = ∅
15	12, 14	eqtrdi 2788	. . . . . . 7 ⊢ (𝐼 = ∅ → {𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆} = ∅)
16	15	fveq2d 6840	. . . . . 6 ⊢ (𝐼 = ∅ → (𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆}) = (𝐺‘∅))
17	16	fveq2d 6840	. . . . 5 ⊢ (𝐼 = ∅ → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝑀‘(𝐺‘∅)))
18		riin0 5025	. . . . 5 ⊢ (𝐼 = ∅ → (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)) = 𝐴)
19	17, 18	eqeq12d 2753	. . . 4 ⊢ (𝐼 = ∅ → ((𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)) ↔ (𝑀‘(𝐺‘∅)) = 𝐴))
20	10, 19	syl5ibrcom 247	. . 3 ⊢ (𝐾 ∈ HL → (𝐼 = ∅ → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))))
21	20	adantr 480	. 2 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝐼 = ∅ → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))))
22		pmapglb2.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
23	22, 2, 7	pmapglbx 40235	. . . 4 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝐼 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))
24		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐾 ∈ HL
25		nfra1 3262	. . . . . . . . . 10 ⊢ Ⅎ𝑖∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵
26	24, 25	nfan 1901	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵)
27		simpr 484	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → 𝑖 ∈ 𝐼)
28		simpll 767	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → 𝐾 ∈ HL)
29		rspa 3227	. . . . . . . . . . . . 13 ⊢ ((∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝑖 ∈ 𝐼) → 𝑆 ∈ 𝐵)
30	29	adantll 715	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → 𝑆 ∈ 𝐵)
31	22, 6, 7	pmapssat 40225	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → (𝑀‘𝑆) ⊆ 𝐴)
32	28, 30, 31	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → (𝑀‘𝑆) ⊆ 𝐴)
33	27, 32	jca 511	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → (𝑖 ∈ 𝐼 ∧ (𝑀‘𝑆) ⊆ 𝐴))
34	33	ex 412	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝑖 ∈ 𝐼 → (𝑖 ∈ 𝐼 ∧ (𝑀‘𝑆) ⊆ 𝐴)))
35	26, 34	eximd 2224	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (∃𝑖 𝑖 ∈ 𝐼 → ∃𝑖(𝑖 ∈ 𝐼 ∧ (𝑀‘𝑆) ⊆ 𝐴)))
36		n0 4294	. . . . . . . 8 ⊢ (𝐼 ≠ ∅ ↔ ∃𝑖 𝑖 ∈ 𝐼)
37		df-rex 3063	. . . . . . . 8 ⊢ (∃𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴 ↔ ∃𝑖(𝑖 ∈ 𝐼 ∧ (𝑀‘𝑆) ⊆ 𝐴))
38	35, 36, 37	3imtr4g 296	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝐼 ≠ ∅ → ∃𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴))
39	38	3impia 1118	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝐼 ≠ ∅) → ∃𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴)
40		iinss 5000	. . . . . 6 ⊢ (∃𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴 → ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴)
41	39, 40	syl 17	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝐼 ≠ ∅) → ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴)
42		sseqin2 4164	. . . . 5 ⊢ (∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆) ⊆ 𝐴 ↔ (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)) = ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))
43	41, 42	sylib 218	. . . 4 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝐼 ≠ ∅) → (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)) = ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))
44	23, 43	eqtr4d 2775	. . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝐼 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)))
45	44	3expia 1122	. 2 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝐼 ≠ ∅ → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆))))
46	21, 45	pm2.61dne 3019	1 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆})) = (𝐴 ∩ ∩ 𝑖 ∈ 𝐼 (𝑀‘𝑆)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  ∃wrex 3062   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274  ∩ ciin 4935  ‘cfv 6494  Basecbs 17174  glbcglb 18271  1.cp1 18383  OPcops 39638  Atomscatm 39729  HLchlt 39816  pmapcpmap 39963

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-riota 7319  df-ov 7365  df-oprab 7366  df-proset 18255  df-poset 18274  df-lub 18305  df-glb 18306  df-join 18307  df-meet 18308  df-p1 18385  df-lat 18393  df-clat 18460  df-oposet 39642  df-ol 39644  df-oml 39645  df-ats 39733  df-hlat 39817  df-pmap 39970

This theorem is referenced by:  polval2N  40372