Theorem islpoldN 41948

Description: Properties that determine a polarity. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lpolset.v	⊢ 𝑉 = (Base‘𝑊)
lpolset.s	⊢ 𝑆 = (LSubSp‘𝑊)
lpolset.z	⊢ 0 = (0g‘𝑊)
lpolset.a	⊢ 𝐴 = (LSAtoms‘𝑊)
lpolset.h	⊢ 𝐻 = (LSHyp‘𝑊)
lpolset.p	⊢ 𝑃 = (LPol‘𝑊)
islpold.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)
islpold.1	⊢ (𝜑 → ⊥ :𝒫 𝑉⟶𝑆)
islpold.2	⊢ (𝜑 → ( ⊥ ‘𝑉) = { 0 })
islpold.3	⊢ ((𝜑 ∧ (𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦)) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥))
islpold.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ( ⊥ ‘𝑥) ∈ 𝐻)
islpold.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)

Assertion

Ref	Expression
islpoldN	⊢ (𝜑 → ⊥ ∈ 𝑃)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝑊   𝑥, ⊥ ,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑦)   𝑃(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐻(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑋(𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem islpoldN

Step	Hyp	Ref	Expression
1		islpold.1	. 2 ⊢ (𝜑 → ⊥ :𝒫 𝑉⟶𝑆)
2		islpold.2	. . 3 ⊢ (𝜑 → ( ⊥ ‘𝑉) = { 0 })
3		islpold.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦)) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥))
4	3	ex 412	. . . 4 ⊢ (𝜑 → ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)))
5	4	alrimivv 1930	. . 3 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)))
6		islpold.4	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ( ⊥ ‘𝑥) ∈ 𝐻)
7		islpold.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)
8	6, 7	jca 511	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
9	8	ralrimiva 3130	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
10	2, 5, 9	3jca 1129	. 2 ⊢ (𝜑 → (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))
11		islpold.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
12		lpolset.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
13		lpolset.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑊)
14		lpolset.z	. . . 4 ⊢ 0 = (0g‘𝑊)
15		lpolset.a	. . . 4 ⊢ 𝐴 = (LSAtoms‘𝑊)
16		lpolset.h	. . . 4 ⊢ 𝐻 = (LSHyp‘𝑊)
17		lpolset.p	. . . 4 ⊢ 𝑃 = (LPol‘𝑊)
18	12, 13, 14, 15, 16, 17	islpolN 41947	. . 3 ⊢ (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶𝑆 ∧ (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
19	11, 18	syl 17	. 2 ⊢ (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶𝑆 ∧ (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ 𝐻 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
20	1, 10, 19	mpbir2and 714	1 ⊢ (𝜑 → ⊥ ∈ 𝑃)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3890  𝒫 cpw 4542  {csn 4568  ⟶wf 6490  ‘cfv 6494  Basecbs 17174  0_gc0g 17397  LSubSpclss 20921  LSAtomsclsa 39438  LSHypclsh 39439  LPolclpoN 41944

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-fv 6502  df-ov 7365  df-oprab 7366  df-mpo 7367  df-map 8770  df-lpolN 41945

This theorem is referenced by:  dochpolN  41954