Theorem polfvalN 40103

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.

Step	Hyp	Ref	Expression
1		elex 3459	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		polfval.p	. . 3 ⊢ 𝑃 = (⊥𝑃‘𝐾)
3		fveq2 6832	. . . . . . 7 ⊢ (ℎ = 𝐾 → (Atoms‘ℎ) = (Atoms‘𝐾))
4		polfval.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2787	. . . . . 6 ⊢ (ℎ = 𝐾 → (Atoms‘ℎ) = 𝐴)
6	5	pweqd 4569	. . . . 5 ⊢ (ℎ = 𝐾 → 𝒫 (Atoms‘ℎ) = 𝒫 𝐴)
7		fveq2 6832	. . . . . . . . . 10 ⊢ (ℎ = 𝐾 → (pmap‘ℎ) = (pmap‘𝐾))
8		polfval.m	. . . . . . . . . 10 ⊢ 𝑀 = (pmap‘𝐾)
9	7, 8	eqtr4di 2787	. . . . . . . . 9 ⊢ (ℎ = 𝐾 → (pmap‘ℎ) = 𝑀)
10		fveq2 6832	. . . . . . . . . . 11 ⊢ (ℎ = 𝐾 → (oc‘ℎ) = (oc‘𝐾))
11		polfval.o	. . . . . . . . . . 11 ⊢ ⊥ = (oc‘𝐾)
12	10, 11	eqtr4di 2787	. . . . . . . . . 10 ⊢ (ℎ = 𝐾 → (oc‘ℎ) = ⊥ )
13	12	fveq1d 6834	. . . . . . . . 9 ⊢ (ℎ = 𝐾 → ((oc‘ℎ)‘𝑝) = ( ⊥ ‘𝑝))
14	9, 13	fveq12d 6839	. . . . . . . 8 ⊢ (ℎ = 𝐾 → ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = (𝑀‘( ⊥ ‘𝑝)))
15	14	adantr 480	. . . . . . 7 ⊢ ((ℎ = 𝐾 ∧ 𝑝 ∈ 𝑚) → ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = (𝑀‘( ⊥ ‘𝑝)))
16	15	iineq2dv 4970	. . . . . 6 ⊢ (ℎ = 𝐾 → ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))
17	5, 16	ineq12d 4171	. . . . 5 ⊢ (ℎ = 𝐾 → ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝))) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))
18	6, 17	mpteq12dv 5183	. . . 4 ⊢ (ℎ = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘ℎ) ↦ ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
19		df-polarityN 40102	. . . 4 ⊢ ⊥𝑃 = (ℎ ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘ℎ) ↦ ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)))))
20	4	fvexi 6846	. . . . . 6 ⊢ 𝐴 ∈ V
21	20	pwex 5323	. . . . 5 ⊢ 𝒫 𝐴 ∈ V
22	21	mptex 7167	. . . 4 ⊢ (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))) ∈ V
23	18, 19, 22	fvmpt 6939	. . 3 ⊢ (𝐾 ∈ V → (⊥𝑃‘𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
24	2, 23	eqtrid 2781	. 2 ⊢ (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
25	1, 24	syl 17	1 ⊢ (𝐾 ∈ 𝐵 → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  Vcvv 3438   ∩ cin 3898  𝒫 cpw 4552  ∩ ciin 4945   ↦ cmpt 5177  ‘cfv 6490  occoc 17183  Atomscatm 39462  pmapcpmap 39696  ⊥_𝑃cpolN 40101

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-polarityN 40102

This theorem is referenced by:  polvalN  40104