Theorem pmapval 40564

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 40563	. . 3 ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
6	5	fveq1d 6887	. 2 ⊢ (𝐾 ∈ 𝐶 → (𝑀‘𝑋) = ((𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})‘𝑋))
7		breq2 5115	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑎 ≤ 𝑥 ↔ 𝑎 ≤ 𝑋))
8	7	rabbidv 3425	. . 3 ⊢ (𝑥 = 𝑋 → {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥} = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})
9		eqid 2765	. . 3 ⊢ (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})
10	3	fvexi 6899	. . . 4 ⊢ 𝐴 ∈ V
11	10	rabex 5311	. . 3 ⊢ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋} ∈ V
12	8, 9, 11	fvmpt 6993	. 2 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})‘𝑋) = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})
13	6, 12	sylan9eq 2820	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑋})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {crab 3418   class class class wbr 5111   ↦ cmpt 5194  ‘cfv 6540  Basecbs 17287  lecple 17335  Atomscatm 40070  pmapcpmap 40304

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-pmap 40311

This theorem is used by:  elpmap  40565  pmapssat  40566  pmaple  40568  pmapat  40570  pmap0  40572  pmap1N  40574  pmapsub  40575  pmapglbx  40576  isline2  40581  linepmap  40582  polpmapN  40719  2polssN  40722  pmaplubN  40731