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 41154
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 6922 . . 3 𝐴 ∈ V
32elpw2 5300 . 2 (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴)
4 polfval.o . . . . 5 ⊥ = (oc‘𝐾)
5 polfval.m . . . . 5 𝑀 = (pmap‘𝐾)
6 polfval.p . . . . 5 𝑃 = (⊥𝑃‘𝐾)
74, 1, 5, 6polfvalN 41153 . . . 4 (𝐾 ∈ 𝐵 → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
87fveq1d 6910 . . 3 (𝐾 ∈ 𝐵 → (𝑃‘𝑋) = ((𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))‘𝑋))
9 iineq1 4972 . . . . 5 (𝑚 = 𝑋 → ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)) = ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝)))
109ineq2d 4120 . . . 4 (𝑚 = 𝑋 → (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
11 eqid 2763 . . . 4 (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))
122inex1 5281 . . . 4 (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))) ∈ V
1310, 11, 12fvmpt 7016 . . 3 (𝑋 ∈ 𝒫 𝐴 → ((𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
148, 13sylan9eq 2818 . 2 ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴) → (𝑃‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
153, 14sylan2br 607 1 ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑃‘𝑋) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑋 (𝑀‘( ⊥ ‘𝑝))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∩ ciin 4955   ↦ cmpt 5189  ‘cfv 6558  occoc 17465  Atomscatm 40512  pmapcpmap 40746  ⊥𝑃cpolN 41151
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-polarityN 41152
This theorem is used by:  polval2N  41155  pol0N  41158  polcon3N  41166  polatN  41180
  Copyright terms: Public domain W3C validator