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 40698
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 3476 . 2 (𝐾𝐵𝐾 ∈ V)
2 polfval.p . . 3 𝑃 = (⊥𝑃𝐾)
3 fveq2 6881 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 polfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2816 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4579 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 fveq2 6881 . . . . . . . . . 10 ( = 𝐾 → (pmap‘) = (pmap‘𝐾))
8 polfval.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
97, 8eqtr4di 2816 . . . . . . . . 9 ( = 𝐾 → (pmap‘) = 𝑀)
10 fveq2 6881 . . . . . . . . . . 11 ( = 𝐾 → (oc‘) = (oc‘𝐾))
11 polfval.o . . . . . . . . . . 11 = (oc‘𝐾)
1210, 11eqtr4di 2816 . . . . . . . . . 10 ( = 𝐾 → (oc‘) = )
1312fveq1d 6883 . . . . . . . . 9 ( = 𝐾 → ((oc‘)‘𝑝) = ( 𝑝))
149, 13fveq12d 6888 . . . . . . . 8 ( = 𝐾 → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1514adantr 485 . . . . . . 7 (( = 𝐾𝑝𝑚) → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1615iineq2dv 4982 . . . . . 6 ( = 𝐾 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)) = 𝑝𝑚 (𝑀‘( 𝑝)))
175, 16ineq12d 4174 . . . . 5 ( = 𝐾 → ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝))) = (𝐴 𝑝𝑚 (𝑀‘( 𝑝))))
186, 17mpteq12dv 5198 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
19 df-polarityN 40697 . . . 4 𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))))
204fvexi 6895 . . . . . 6 𝐴 ∈ V
2120pwex 5351 . . . . 5 𝒫 𝐴 ∈ V
2221mptex 7221 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))) ∈ V
2318, 19, 22fvmpt 6989 . . 3 (𝐾 ∈ V → (⊥𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
242, 23eqtrid 2810 . 2 (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
251, 24syl 18 1 (𝐾𝐵𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  Vcvv 3455  cin 3904  𝒫 cpw 4562   ciin 4957  cmpt 5192  cfv 6536  occoc 17313  Atomscatm 40057  pmapcpmap 40291  𝑃cpolN 40696
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-polarityN 40697
This theorem is referenced by:  polvalN  40699
  Copyright terms: Public domain W3C validator