Theorem lpolsatN 42737

Description: The polarity of an atomic subspace is a hyperplane. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lpolsat.a	⊢ 𝐴 = (LSAtoms‘𝑊)
lpolsat.h	⊢ 𝐻 = (LSHyp‘𝑊)
lpolsat.p	⊢ 𝑃 = (LPol‘𝑊)
lpolsat.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)
lpolsat.o	⊢ (𝜑 → ⊥ ∈ 𝑃)
lpolsat.q	⊢ (𝜑 → 𝑄 ∈ 𝐴)

Assertion

Ref	Expression
lpolsatN	⊢ (𝜑 → ( ⊥ ‘𝑄) ∈ 𝐻)

Proof of Theorem lpolsatN

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lpolsat.o	. . 3 ⊢ (𝜑 → ⊥ ∈ 𝑃)
2		lpolsat.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
3		eqid 2763	. . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊)
4		eqid 2763	. . . . 5 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊)
5		eqid 2763	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
6		lpolsat.a	. . . . 5 ⊢ 𝐴 = (LSAtoms‘𝑊)
7		lpolsat.h	. . . . 5 ⊢ 𝐻 = (LSHyp‘𝑊)
8		lpolsat.p	. . . . 5 ⊢ 𝑃 = (LPol‘𝑊)
9	3, 4, 5, 6, 7, 8	islpolN 42732	. . . 4 ⊢ (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
10	2, 9	syl 18	. . 3 ⊢ (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
11	1, 10	mpbid 235	. 2 ⊢ (𝜑 → ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12		simpr3 1215	. . 3 ⊢ (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
13		lpolsat.q	. . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝐴)
14		fveq2 6908	. . . . . . 7 ⊢ (𝑥 = 𝑄 → ( ⊥ ‘𝑥) = ( ⊥ ‘𝑄))
15	14	eleq1d 2849	. . . . . 6 ⊢ (𝑥 = 𝑄 → (( ⊥ ‘𝑥) ∈ 𝐻 ↔ ( ⊥ ‘𝑄) ∈ 𝐻))
16		2fveq3 6913	. . . . . . 7 ⊢ (𝑥 = 𝑄 → ( ⊥ ‘( ⊥ ‘𝑥)) = ( ⊥ ‘( ⊥ ‘𝑄)))
17		id 23	. . . . . . 7 ⊢ (𝑥 = 𝑄 → 𝑥 = 𝑄)
18	16, 17	eqeq12d 2779	. . . . . 6 ⊢ (𝑥 = 𝑄 → (( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ↔ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄))
19	15, 18	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝑄 → ((( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) ↔ (( ⊥ ‘𝑄) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
20	19	rspcv 3576	. . . 4 ⊢ (𝑄 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
21	13, 20	syl 18	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
22		simpl 488	. . 3 ⊢ ((( ⊥ ‘𝑄) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄) → ( ⊥ ‘𝑄) ∈ 𝐻)
23	12, 21, 22	syl56 37	. 2 ⊢ (𝜑 → (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ( ⊥ ‘𝑄) ∈ 𝐻))
24	11, 23	mpd 16	1 ⊢ (𝜑 → ( ⊥ ‘𝑄) ∈ 𝐻)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  𝒫 cpw 4560  {csn 4588  ⟶wf 6554  ‘cfv 6558  Basecbs 17416  0_gc0g 17639  LSubSpclss 21236  LSAtomsclsa 40223  LSHypclsh 40224  LPolclpoN 42729

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-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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-rab 3417  df-v 3456  df-sbc 3743  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-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-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-lpolN 42730

This theorem is used by: (None)