Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  polfvalN Structured version   Visualization version   GIF version

Theorem polfvalN 37042
Description: The projective subspace polarity function. (Contributed by NM, 23-Oct-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
polfval.o = (oc‘𝐾)
polfval.a 𝐴 = (Atoms‘𝐾)
polfval.m 𝑀 = (pmap‘𝐾)
polfval.p 𝑃 = (⊥𝑃𝐾)
Assertion
Ref Expression
polfvalN (𝐾𝐵𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
Distinct variable groups:   𝐴,𝑚   𝑚,𝑝,𝐾
Allowed substitution hints:   𝐴(𝑝)   𝐵(𝑚,𝑝)   𝑃(𝑚,𝑝)   𝑀(𝑚,𝑝)   (𝑚,𝑝)

Proof of Theorem polfvalN
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 elex 3514 . 2 (𝐾𝐵𝐾 ∈ V)
2 polfval.p . . 3 𝑃 = (⊥𝑃𝐾)
3 fveq2 6672 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 polfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4syl6eqr 2876 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4560 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 fveq2 6672 . . . . . . . . . 10 ( = 𝐾 → (pmap‘) = (pmap‘𝐾))
8 polfval.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
97, 8syl6eqr 2876 . . . . . . . . 9 ( = 𝐾 → (pmap‘) = 𝑀)
10 fveq2 6672 . . . . . . . . . . 11 ( = 𝐾 → (oc‘) = (oc‘𝐾))
11 polfval.o . . . . . . . . . . 11 = (oc‘𝐾)
1210, 11syl6eqr 2876 . . . . . . . . . 10 ( = 𝐾 → (oc‘) = )
1312fveq1d 6674 . . . . . . . . 9 ( = 𝐾 → ((oc‘)‘𝑝) = ( 𝑝))
149, 13fveq12d 6679 . . . . . . . 8 ( = 𝐾 → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1514adantr 483 . . . . . . 7 (( = 𝐾𝑝𝑚) → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1615iineq2dv 4946 . . . . . 6 ( = 𝐾 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)) = 𝑝𝑚 (𝑀‘( 𝑝)))
175, 16ineq12d 4192 . . . . 5 ( = 𝐾 → ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝))) = (𝐴 𝑝𝑚 (𝑀‘( 𝑝))))
186, 17mpteq12dv 5153 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
19 df-polarityN 37041 . . . 4 𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))))
204fvexi 6686 . . . . . 6 𝐴 ∈ V
2120pwex 5283 . . . . 5 𝒫 𝐴 ∈ V
2221mptex 6988 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))) ∈ V
2318, 19, 22fvmpt 6770 . . 3 (𝐾 ∈ V → (⊥𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
242, 23syl5eq 2870 . 2 (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
251, 24syl 17 1 (𝐾𝐵𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  Vcvv 3496  cin 3937  𝒫 cpw 4541   ciin 4922  cmpt 5148  cfv 6357  occoc 16575  Atomscatm 36401  pmapcpmap 36635  𝑃cpolN 37040
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-polarityN 37041
This theorem is referenced by:  polvalN  37043
  Copyright terms: Public domain W3C validator