Theorem pmapglb 35056

Description: The projective map of the GLB of a set of lattice elements 𝑆. Variant of Theorem 15.5.2 of [MaedaMaeda] p. 62. (Contributed by NM, 5-Dec-2011.)

Hypotheses

Ref	Expression
pmapglb.b	⊢ 𝐵 = (Base‘𝐾)
pmapglb.g	⊢ 𝐺 = (glb‘𝐾)
pmapglb.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
pmapglb	⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐾   𝑥,𝑆

Allowed substitution hints:   𝐺(𝑥)   𝑀(𝑥)

Proof of Theorem pmapglb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 2918	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥))
2		equcom 1945	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦)
3	2	anbi2i 730	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ 𝑆 ∧ 𝑥 = 𝑦))
4		ancom 466	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑥 = 𝑦) ↔ (𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆))
5	3, 4	bitri 264	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ (𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆))
6	5	exbii 1774	. . . . . . . 8 ⊢ (∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆))
7		vex 3203	. . . . . . . . 9 ⊢ 𝑦 ∈ V
8		eleq1 2689	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
9	7, 8	ceqsexv 3242	. . . . . . . 8 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆) ↔ 𝑦 ∈ 𝑆)
10	6, 9	bitri 264	. . . . . . 7 ⊢ (∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ 𝑦 ∈ 𝑆)
11	1, 10	bitri 264	. . . . . 6 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ 𝑦 ∈ 𝑆)
12	11	abbii 2739	. . . . 5 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} = {𝑦 ∣ 𝑦 ∈ 𝑆}
13		abid2 2745	. . . . 5 ⊢ {𝑦 ∣ 𝑦 ∈ 𝑆} = 𝑆
14	12, 13	eqtr2i 2645	. . . 4 ⊢ 𝑆 = {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥}
15	14	fveq2i 6194	. . 3 ⊢ (𝐺‘𝑆) = (𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})
16	15	fveq2i 6194	. 2 ⊢ (𝑀‘(𝐺‘𝑆)) = (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥}))
17		dfss3 3592	. . 3 ⊢ (𝑆 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵)
18		pmapglb.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
19		pmapglb.g	. . . 4 ⊢ 𝐺 = (glb‘𝐾)
20		pmapglb.m	. . . 4 ⊢ 𝑀 = (pmap‘𝐾)
21	18, 19, 20	pmapglbx 35055	. . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥))
22	17, 21	syl3an2b 1363	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥))
23	16, 22	syl5eq 2668	1 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥))

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483  ∃wex 1704   ∈ wcel 1990  {cab 2608   ≠ wne 2794  ∀wral 2912  ∃wrex 2913   ⊆ wss 3574  ∅c0 3915  ∩ ciin 4521  ‘cfv 5888  Basecbs 15857  glbcglb 16943  HLchlt 34637  pmapcpmap 34783

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-poset 16946  df-lub 16974  df-glb 16975  df-join 16976  df-meet 16977  df-lat 17046  df-clat 17108  df-ats 34554  df-hlat 34638  df-pmap 34790

This theorem is referenced by:  pmapglb2N  35057  pmapmeet  35059