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 40367
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 3451 . 2 (𝐾𝐵𝐾 ∈ V)
2 polfval.p . . 3 𝑃 = (⊥𝑃𝐾)
3 fveq2 6835 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 polfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2790 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4559 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 fveq2 6835 . . . . . . . . . 10 ( = 𝐾 → (pmap‘) = (pmap‘𝐾))
8 polfval.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
97, 8eqtr4di 2790 . . . . . . . . 9 ( = 𝐾 → (pmap‘) = 𝑀)
10 fveq2 6835 . . . . . . . . . . 11 ( = 𝐾 → (oc‘) = (oc‘𝐾))
11 polfval.o . . . . . . . . . . 11 = (oc‘𝐾)
1210, 11eqtr4di 2790 . . . . . . . . . 10 ( = 𝐾 → (oc‘) = )
1312fveq1d 6837 . . . . . . . . 9 ( = 𝐾 → ((oc‘)‘𝑝) = ( 𝑝))
149, 13fveq12d 6842 . . . . . . . 8 ( = 𝐾 → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1514adantr 480 . . . . . . 7 (( = 𝐾𝑝𝑚) → ((pmap‘)‘((oc‘)‘𝑝)) = (𝑀‘( 𝑝)))
1615iineq2dv 4960 . . . . . 6 ( = 𝐾 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)) = 𝑝𝑚 (𝑀‘( 𝑝)))
175, 16ineq12d 4162 . . . . 5 ( = 𝐾 → ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝))) = (𝐴 𝑝𝑚 (𝑀‘( 𝑝))))
186, 17mpteq12dv 5173 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
19 df-polarityN 40366 . . . 4 𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘) ↦ ((Atoms‘) ∩ 𝑝𝑚 ((pmap‘)‘((oc‘)‘𝑝)))))
204fvexi 6849 . . . . . 6 𝐴 ∈ V
2120pwex 5318 . . . . 5 𝒫 𝐴 ∈ V
2221mptex 7172 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))) ∈ V
2318, 19, 22fvmpt 6942 . . 3 (𝐾 ∈ V → (⊥𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
242, 23eqtrid 2784 . 2 (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
251, 24syl 17 1 (𝐾𝐵𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 𝑝𝑚 (𝑀‘( 𝑝)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3430  cin 3889  𝒫 cpw 4542   ciin 4935  cmpt 5167  cfv 6493  occoc 17222  Atomscatm 39726  pmapcpmap 39960  𝑃cpolN 40365
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-polarityN 40366
This theorem is referenced by:  polvalN  40368
  Copyright terms: Public domain W3C validator