Theorem pmapval 34061

Description: Value of the projective map of a Hilbert lattice. Definition in Theorem 15.5 of [MaedaMaeda] p. 62. (Contributed by NM, 2-Oct-2011.)

Hypotheses

Ref	Expression
pmapfval.b	⊢ 𝐵 = (Base‘𝐾)
pmapfval.l	⊢ ≤ = (le‘𝐾)
pmapfval.a	⊢ 𝐴 = (Atoms‘𝐾)
pmapfval.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
pmapval	⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})

Distinct variable groups:   𝐴,𝑎   𝐾,𝑎   𝑋,𝑎

Allowed substitution hints:   𝐵(𝑎)   𝐶(𝑎)   ≤ (𝑎)   𝑀(𝑎)

Proof of Theorem pmapval

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pmapfval.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		pmapfval.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		pmapfval.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
4		pmapfval.m	. . . 4 ⊢ 𝑀 = (pmap‘𝐾)
5	1, 2, 3, 4	pmapfval 34060	. . 3 ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
6	5	fveq1d 6105	. 2 ⊢ (𝐾 ∈ 𝐶 → (𝑀‘𝑋) = ((𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})‘𝑋))
7		breq2 4587	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑎 ≤ 𝑥 ↔ 𝑎 ≤ 𝑋))
8	7	rabbidv 3164	. . 3 ⊢ (𝑥 = 𝑋 → {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥} = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})
9		eqid 2610	. . 3 ⊢ (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})
10		fvex 6113	. . . . 5 ⊢ (Atoms‘𝐾) ∈ V
11	3, 10	eqeltri 2684	. . . 4 ⊢ 𝐴 ∈ V
12	11	rabex 4740	. . 3 ⊢ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋} ∈ V
13	8, 9, 12	fvmpt 6191	. 2 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})‘𝑋) = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})
14	6, 13	sylan9eq 2664	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {crab 2900  Vcvv 3173   class class class wbr 4583   ↦ cmpt 4643  ‘cfv 5804  Basecbs 15695  lecple 15775  Atomscatm 33568  pmapcpmap 33801

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-pmap 33808

This theorem is referenced by:  elpmap  34062  pmapssat  34063  pmaple  34065  pmapat  34067  pmap0  34069  pmap1N  34071  pmapsub  34072  pmapglbx  34073  isline2  34078  linepmap  34079  polpmapN  34216  2polssN  34219  pmaplubN  34228