Theorem lpolpolsatN 40994

Description: Property of a polarity. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
lpolpolsatN	⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)

Proof of Theorem lpolpolsatN

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

Step	Hyp	Ref	Expression
1		lpolpolsat.o	. . 3 ⊢ (𝜑 → ⊥ ∈ 𝑃)
2		lpolpolsat.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
3		eqid 2728	. . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊)
4		eqid 2728	. . . . 5 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊)
5		eqid 2728	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
6		lpolpolsat.a	. . . . 5 ⊢ 𝐴 = (LSAtoms‘𝑊)
7		eqid 2728	. . . . 5 ⊢ (LSHyp‘𝑊) = (LSHyp‘𝑊)
8		lpolpolsat.p	. . . . 5 ⊢ 𝑃 = (LPol‘𝑊)
9	3, 4, 5, 6, 7, 8	islpolN 40988	. . . 4 ⊢ (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
10	2, 9	syl 17	. . 3 ⊢ (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
11	1, 10	mpbid 231	. 2 ⊢ (𝜑 → ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12		simpr3 1193	. . 3 ⊢ (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
13		lpolpolsat.q	. . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝐴)
14		fveq2 6902	. . . . . . 7 ⊢ (𝑥 = 𝑄 → ( ⊥ ‘𝑥) = ( ⊥ ‘𝑄))
15	14	eleq1d 2814	. . . . . 6 ⊢ (𝑥 = 𝑄 → (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ↔ ( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊)))
16		2fveq3 6907	. . . . . . 7 ⊢ (𝑥 = 𝑄 → ( ⊥ ‘( ⊥ ‘𝑥)) = ( ⊥ ‘( ⊥ ‘𝑄)))
17		id 22	. . . . . . 7 ⊢ (𝑥 = 𝑄 → 𝑥 = 𝑄)
18	16, 17	eqeq12d 2744	. . . . . 6 ⊢ (𝑥 = 𝑄 → (( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ↔ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄))
19	15, 18	anbi12d 630	. . . . 5 ⊢ (𝑥 = 𝑄 → ((( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) ↔ (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
20	19	rspcv 3607	. . . 4 ⊢ (𝑄 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
21	13, 20	syl 17	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
22		simpr 483	. . 3 ⊢ ((( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄) → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)
23	12, 21, 22	syl56 36	. 2 ⊢ (𝜑 → (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄))
24	11, 23	mpd 15	1 ⊢ (𝜑 → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084  ∀wal 1531   = wceq 1533   ∈ wcel 2098  ∀wral 3058   ⊆ wss 3949  𝒫 cpw 4606  {csn 4632  ⟶wf 6549  ‘cfv 6553  Basecbs 17187  0_gc0g 17428  LSubSpclss 20822  LSAtomsclsa 38478  LSHypclsh 38479  LPolclpoN 40985

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7746

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-sbc 3779  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-fv 6561  df-ov 7429  df-oprab 7430  df-mpo 7431  df-map 8853  df-lpolN 40986

This theorem is referenced by: (None)

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »