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 37200
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 3459 . 2 (𝐾𝐵𝐾 ∈ V)
2 polfval.p . . 3 𝑃 = (⊥𝑃𝐾)
3 fveq2 6645 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 polfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2851 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4516 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 fveq2 6645 . . . . . . . . . 10 ( = 𝐾 → (pmap‘) = (pmap‘𝐾))
8 polfval.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
97, 8eqtr4di 2851 . . . . . . . . 9 ( = 𝐾 → (pmap‘) = 𝑀)
10 fveq2 6645 . . . . . . . . . . 11 ( = 𝐾 → (oc‘) = (oc‘𝐾))
11 polfval.o . . . . . . . . . . 11 = (oc‘𝐾)
1210, 11eqtr4di 2851 . . . . . . . . . 10 ( = 𝐾 → (oc‘) = )
1312fveq1d 6647 . . . . . . . . 9 ( = 𝐾 → ((oc‘)‘𝑝) = ( 𝑝))
149, 13fveq12d 6652 . . . . . . . 8 ( = 𝐾 → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1514adantr 484 . . . . . . 7 (( = 𝐾𝑝𝑚) → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1615iineq2dv 4906 . . . . . 6 ( = 𝐾 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)) = 𝑝𝑚 (𝑀‘( 𝑝)))
175, 16ineq12d 4140 . . . . 5 ( = 𝐾 → ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝))) = (𝐴 𝑝𝑚 (𝑀‘( 𝑝))))
186, 17mpteq12dv 5115 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
19 df-polarityN 37199 . . . 4 𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))))
204fvexi 6659 . . . . . 6 𝐴 ∈ V
2120pwex 5246 . . . . 5 𝒫 𝐴 ∈ V
2221mptex 6963 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))) ∈ V
2318, 19, 22fvmpt 6745 . . 3 (𝐾 ∈ V → (⊥𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
242, 23syl5eq 2845 . 2 (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
251, 24syl 17 1 (𝐾𝐵𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  wcel 2111  Vcvv 3441  cin 3880  𝒫 cpw 4497   ciin 4882  cmpt 5110  cfv 6324  occoc 16565  Atomscatm 36559  pmapcpmap 36793  𝑃cpolN 37198
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-polarityN 37199
This theorem is referenced by:  polvalN  37201
  Copyright terms: Public domain W3C validator