Theorem pmapfval 40781

Description: The projective map of a Hilbert lattice. (Contributed by NM, 2-Oct-2011.)

Hypotheses

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

Assertion

Ref	Expression
pmapfval	⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))

Distinct variable groups:   𝐴,𝑎   𝑥,𝐵   𝑥,𝑎,𝐾

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑎)   𝐶(𝑥, 𝑎)   ≤ (𝑥, 𝑎)   𝑀(𝑥, 𝑎)

Proof of Theorem pmapfval

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		pmapfval.m	. . 3 ⊢ 𝑀 = (pmap‘𝐾)
3		fveq2 6877	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4		pmapfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2814	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6		fveq2 6877	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7		pmapfval.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
8	6, 7	eqtr4di 2814	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9		fveq2 6877	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
10		pmapfval.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
11	9, 10	eqtr4di 2814	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
12	11	breqd 5114	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑎(le‘𝑘)𝑥 ↔ 𝑎 ≤ 𝑥))
13	8, 12	rabeqbidv 3430	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥} = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})
14	5, 13	mpteq12dv 5192	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
15		df-pmap 40529	. . . 4 ⊢ pmap = (𝑘 ∈ V ↦ (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥}))
16	14, 15, 4	mptfvmpt 7226	. . 3 ⊢ (𝐾 ∈ V → (pmap‘𝐾) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
17	2, 16	eqtrid 2808	. 2 ⊢ (𝐾 ∈ V → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
18	1, 17	syl 18	1 ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6531  Basecbs 17367  lecple 17415  Atomscatm 40288  pmapcpmap 40522

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-pmap 40529

This theorem is used by:  pmapval  40782