Theorem pmapfval 41016

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 3475	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		pmapfval.m	. . 3 ⊢ 𝑀 = (pmap‘𝐾)
3		fveq2 6911	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4		pmapfval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2816	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
6		fveq2 6911	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
7		pmapfval.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
8	6, 7	eqtr4di 2816	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
9		fveq2 6911	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
10		pmapfval.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
11	9, 10	eqtr4di 2816	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
12	11	breqd 5117	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑎(le‘𝑘)𝑥 ↔ 𝑎 ≤ 𝑥))
13	8, 12	rabeqbidv 3433	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥} = {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥})
14	5, 13	mpteq12dv 5196	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
15		df-pmap 40764	. . . 4 ⊢ pmap = (𝑘 ∈ V ↦ (𝑥 ∈ (Base‘𝑘) ↦ {𝑎 ∈ (Atoms‘𝑘) ∣ 𝑎(le‘𝑘)𝑥}))
16	14, 15, 4	mptfvmpt 7260	. . 3 ⊢ (𝐾 ∈ V → (pmap‘𝐾) = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
17	2, 16	eqtrid 2810	. 2 ⊢ (𝐾 ∈ V → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))
18	1, 17	syl 18	1 ⊢ (𝐾 ∈ 𝐶 → 𝑀 = (𝑥 ∈ 𝐵 ↦ {𝑎 ∈ 𝐴 ∣ 𝑎 ≤ 𝑥}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   class class class wbr 5106   ↦ cmpt 5190  ‘cfv 6561  Basecbs 17419  lecple 17467  Atomscatm 40523  pmapcpmap 40757

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-pmap 40764

This theorem is used by:  pmapval  41017