Theorem polfvalN 40780

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 3471	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		polfval.p	. . 3 ⊢ 𝑃 = (⊥𝑃‘𝐾)
3		fveq2 6879	. . . . . . 7 ⊢ (ℎ = 𝐾 → (Atoms‘ℎ) = (Atoms‘𝐾))
4		polfval.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2813	. . . . . 6 ⊢ (ℎ = 𝐾 → (Atoms‘ℎ) = 𝐴)
6	5	pweqd 4574	. . . . 5 ⊢ (ℎ = 𝐾 → 𝒫 (Atoms‘ℎ) = 𝒫 𝐴)
7		fveq2 6879	. . . . . . . . . 10 ⊢ (ℎ = 𝐾 → (pmap‘ℎ) = (pmap‘𝐾))
8		polfval.m	. . . . . . . . . 10 ⊢ 𝑀 = (pmap‘𝐾)
9	7, 8	eqtr4di 2813	. . . . . . . . 9 ⊢ (ℎ = 𝐾 → (pmap‘ℎ) = 𝑀)
10		fveq2 6879	. . . . . . . . . . 11 ⊢ (ℎ = 𝐾 → (oc‘ℎ) = (oc‘𝐾))
11		polfval.o	. . . . . . . . . . 11 ⊢ ⊥ = (oc‘𝐾)
12	10, 11	eqtr4di 2813	. . . . . . . . . 10 ⊢ (ℎ = 𝐾 → (oc‘ℎ) = ⊥ )
13	12	fveq1d 6881	. . . . . . . . 9 ⊢ (ℎ = 𝐾 → ((oc‘ℎ)‘𝑝) = ( ⊥ ‘𝑝))
14	9, 13	fveq12d 6886	. . . . . . . 8 ⊢ (ℎ = 𝐾 → ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = (𝑀‘( ⊥ ‘𝑝)))
15	14	adantr 486	. . . . . . 7 ⊢ ((ℎ = 𝐾 ∧ 𝑝 ∈ 𝑚) → ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = (𝑀‘( ⊥ ‘𝑝)))
16	15	iineq2dv 4977	. . . . . 6 ⊢ (ℎ = 𝐾 → ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)) = ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))
17	5, 16	ineq12d 4167	. . . . 5 ⊢ (ℎ = 𝐾 → ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝))) = (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝))))
18	6, 17	mpteq12dv 5192	. . . 4 ⊢ (ℎ = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘ℎ) ↦ ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)))) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
19		df-polarityN 40779	. . . 4 ⊢ ⊥𝑃 = (ℎ ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘ℎ) ↦ ((Atoms‘ℎ) ∩ ∩ 𝑝 ∈ 𝑚 ((pmap‘ℎ)‘((oc‘ℎ)‘𝑝)))))
20	4	fvexi 6893	. . . . . 6 ⊢ 𝐴 ∈ V
21	20	pwex 5345	. . . . 5 ⊢ 𝒫 𝐴 ∈ V
22	21	mptex 7223	. . . 4 ⊢ (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))) ∈ V
23	18, 19, 22	fvmpt 6987	. . 3 ⊢ (𝐾 ∈ V → (⊥𝑃‘𝐾) = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
24	2, 23	eqtrid 2807	. 2 ⊢ (𝐾 ∈ V → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))
25	1, 24	syl 18	1 ⊢ (𝐾 ∈ 𝐵 → 𝑃 = (𝑚 ∈ 𝒫 𝐴 ↦ (𝐴 ∩ ∩ 𝑝 ∈ 𝑚 (𝑀‘( ⊥ ‘𝑝)))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3898  𝒫 cpw 4557  ∩ ciin 4952   ↦ cmpt 5186  ‘cfv 6533  occoc 17353  Atomscatm 40139  pmapcpmap 40373  ⊥_𝑃cpolN 40778

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398

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 2100  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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-polarityN 40779

This theorem is used by:  polvalN  40781