Theorem lpolconN 42151

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

Hypotheses

Ref	Expression
lpolcon.v	⊢ 𝑉 = (Base‘𝑊)
lpolcon.p	⊢ 𝑃 = (LPol‘𝑊)
lpolcon.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)
lpolcon.o	⊢ (𝜑 → ⊥ ∈ 𝑃)
lpolcon.x	⊢ (𝜑 → 𝑋 ⊆ 𝑉)
lpolcon.y	⊢ (𝜑 → 𝑌 ⊆ 𝑉)
lpolcon.c	⊢ (𝜑 → 𝑋 ⊆ 𝑌)

Assertion

Ref	Expression
lpolconN	⊢ (𝜑 → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))

Proof of Theorem lpolconN

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

Step	Hyp	Ref	Expression
1		lpolcon.o	. . 3 ⊢ (𝜑 → ⊥ ∈ 𝑃)
2		lpolcon.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
3		lpolcon.v	. . . . 5 ⊢ 𝑉 = (Base‘𝑊)
4		eqid 2769	. . . . 5 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊)
5		eqid 2769	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
6		eqid 2769	. . . . 5 ⊢ (LSAtoms‘𝑊) = (LSAtoms‘𝑊)
7		eqid 2769	. . . . 5 ⊢ (LSHyp‘𝑊) = (LSHyp‘𝑊)
8		lpolcon.p	. . . . 5 ⊢ 𝑃 = (LPol‘𝑊)
9	3, 4, 5, 6, 7, 8	islpolN 42147	. . . 4 ⊢ (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
10	2, 9	syl 18	. . 3 ⊢ (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
11	1, 10	mpbid 235	. 2 ⊢ (𝜑 → ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12		simpr2 1212	. . 3 ⊢ (( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)))
13		lpolcon.x	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝑉)
14		lpolcon.y	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑉)
15		lpolcon.c	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝑌)
16	13, 14, 15	3jca 1144	. . . 4 ⊢ (𝜑 → (𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌))
17	3	fvexi 6896	. . . . . . 7 ⊢ 𝑉 ∈ V
18	17	elpw2 5305	. . . . . 6 ⊢ (𝑋 ∈ 𝒫 𝑉 ↔ 𝑋 ⊆ 𝑉)
19	13, 18	sylibr 237	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝒫 𝑉)
20	17	elpw2 5305	. . . . . 6 ⊢ (𝑌 ∈ 𝒫 𝑉 ↔ 𝑌 ⊆ 𝑉)
21	14, 20	sylibr 237	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝑉)
22		sseq1 3970	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ⊆ 𝑉 ↔ 𝑋 ⊆ 𝑉))
23		biidd 265	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑦 ⊆ 𝑉 ↔ 𝑦 ⊆ 𝑉))
24		sseq1 3970	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑦))
25	22, 23, 24	3anbi123d 1462	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) ↔ (𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦)))
26		fveq2 6882	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘𝑥) = ( ⊥ ‘𝑋))
27	26	sseq2d 3977	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥) ↔ ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋)))
28	25, 27	imbi12d 347	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋))))
29		biidd 265	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑋 ⊆ 𝑉 ↔ 𝑋 ⊆ 𝑉))
30		sseq1 3970	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑦 ⊆ 𝑉 ↔ 𝑌 ⊆ 𝑉))
31		sseq2 3971	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑋 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑌))
32	29, 30, 31	3anbi123d 1462	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → ((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) ↔ (𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌)))
33		fveq2 6882	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → ( ⊥ ‘𝑦) = ( ⊥ ‘𝑌))
34	33	sseq1d 3976	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → (( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋) ↔ ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
35	32, 34	imbi12d 347	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
36	28, 35	sylan9bb 518	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
37	36	spc2gv 3568	. . . . 5 ⊢ ((𝑋 ∈ 𝒫 𝑉 ∧ 𝑌 ∈ 𝒫 𝑉) → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
38	19, 21, 37	syl2anc 595	. . . 4 ⊢ (𝜑 → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
39	16, 38	mpid 45	. . 3 ⊢ (𝜑 → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
40	12, 39	syl5 35	. 2 ⊢ (𝜑 → (( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
41	11, 40	mpd 16	1 ⊢ (𝜑 → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101  ∀wal 1565   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ⊆ wss 3913  𝒫 cpw 4567  {csn 4594  ⟶wf 6533  ‘cfv 6537  Basecbs 17269  0_gc0g 17492  LSubSpclss 21030  LSAtomsclsa 39638  LSHypclsh 39639  LPolclpoN 42144

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-lpolN 42145

This theorem is referenced by: (None)