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

Theorem polvalN 41005
Description: Value of 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
polvalN ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑃‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
Distinct variable groups:   𝐾,𝑝   𝑋,𝑝
Allowed substitution hints:   𝐴(𝑝)   𝐵(𝑝)   𝑃(𝑝)   𝑀(𝑝)   ⊥ (𝑝)

Proof of Theorem polvalN
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 polfval.a . . . 4 𝐴 = (Atoms‘𝐾)
21fvexi 6899 . . 3 𝐴 ∈ V
32elpw2 5295 . 2 (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴)
4 polfval.o . . . . 5 ⊥ = (oc‘𝐾)
5 polfval.m . . . . 5 𝑀 = (pmap‘𝐾)
6 polfval.p . . . . 5 𝑃 = (⊥𝑃‘𝐾)
74, 1, 5, 6polfvalN 41004 . . . 4 (𝐾 ∈ 𝐵 → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
87fveq1d 6887 . . 3 (𝐾 ∈ 𝐵 → (𝑃‘𝑋) = ((𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))‘𝑋))
9 iineq1 4968 . . . . 5 (𝑚 = 𝑋 → ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)) = ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝)))
109ineq2d 4117 . . . 4 (𝑚 = 𝑋 → (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
11 eqid 2760 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))
122inex1 5276 . . . 4 (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))) ∈ V
1310, 11, 12fvmpt 6993 . . 3 (𝑋 ∈ 𝒫 𝐴 → ((𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
148, 13sylan9eq 2815 . 2 ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴) → (𝑃‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
153, 14sylan2br 607 1 ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑃‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  ∩ ciin 4951   ↦ cmpt 5185  ‘cfv 6538  occoc 17436  Atomscatm 40363  pmapcpmap 40597  ⊥𝑃cpolN 41002
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-polarityN 41003
This theorem is used by:  polval2N  41006  pol0N  41009  polcon3N  41017  polatN  41031
  Copyright terms: Public domain W3C validator