Theorem lpolconN 40960

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 2728	. . . . 5 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊)
5		eqid 2728	. . . . 5 ⊢ (0g‘𝑊) = (0g‘𝑊)
6		eqid 2728	. . . . 5 ⊢ (LSAtoms‘𝑊) = (LSAtoms‘𝑊)
7		eqid 2728	. . . . 5 ⊢ (LSHyp‘𝑊) = (LSHyp‘𝑊)
8		lpolcon.p	. . . . 5 ⊢ 𝑃 = (LPol‘𝑊)
9	3, 4, 5, 6, 7, 8	islpolN 40956	. . . 4 ⊢ (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
10	2, 9	syl 17	. . 3 ⊢ (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
11	1, 10	mpbid 231	. 2 ⊢ (𝜑 → ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12		simpr2 1193	. . 3 ⊢ (( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)))
13		lpolcon.x	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝑉)
14		lpolcon.y	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑉)
15		lpolcon.c	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝑌)
16	13, 14, 15	3jca 1126	. . . 4 ⊢ (𝜑 → (𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌))
17	3	fvexi 6911	. . . . . . 7 ⊢ 𝑉 ∈ V
18	17	elpw2 5347	. . . . . 6 ⊢ (𝑋 ∈ 𝒫 𝑉 ↔ 𝑋 ⊆ 𝑉)
19	13, 18	sylibr 233	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝒫 𝑉)
20	17	elpw2 5347	. . . . . 6 ⊢ (𝑌 ∈ 𝒫 𝑉 ↔ 𝑌 ⊆ 𝑉)
21	14, 20	sylibr 233	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝑉)
22		sseq1 4005	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ⊆ 𝑉 ↔ 𝑋 ⊆ 𝑉))
23		biidd 262	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑦 ⊆ 𝑉 ↔ 𝑦 ⊆ 𝑉))
24		sseq1 4005	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑥 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑦))
25	22, 23, 24	3anbi123d 1433	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) ↔ (𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦)))
26		fveq2 6897	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘𝑥) = ( ⊥ ‘𝑋))
27	26	sseq2d 4012	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥) ↔ ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋)))
28	25, 27	imbi12d 344	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋))))
29		biidd 262	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑋 ⊆ 𝑉 ↔ 𝑋 ⊆ 𝑉))
30		sseq1 4005	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑦 ⊆ 𝑉 ↔ 𝑌 ⊆ 𝑉))
31		sseq2 4006	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑋 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑌))
32	29, 30, 31	3anbi123d 1433	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → ((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) ↔ (𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌)))
33		fveq2 6897	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → ( ⊥ ‘𝑦) = ( ⊥ ‘𝑌))
34	33	sseq1d 4011	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → (( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋) ↔ ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
35	32, 34	imbi12d 344	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (((𝑋 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑋)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
36	28, 35	sylan9bb 509	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ↔ ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
37	36	spc2gv 3587	. . . . 5 ⊢ ((𝑋 ∈ 𝒫 𝑉 ∧ 𝑌 ∈ 𝒫 𝑉) → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
38	19, 21, 37	syl2anc 583	. . . 4 ⊢ (𝜑 → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ((𝑋 ⊆ 𝑉 ∧ 𝑌 ⊆ 𝑉 ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))))
39	16, 38	mpid 44	. . 3 ⊢ (𝜑 → (∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
40	12, 39	syl5 34	. 2 ⊢ (𝜑 → (( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋)))
41	11, 40	mpd 15	1 ⊢ (𝜑 → ( ⊥ ‘𝑌) ⊆ ( ⊥ ‘𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085  ∀wal 1532   = wceq 1534   ∈ wcel 2099  ∀wral 3058   ⊆ wss 3947  𝒫 cpw 4603  {csn 4629  ⟶wf 6544  ‘cfv 6548  Basecbs 17180  0_gc0g 17421  LSubSpclss 20815  LSAtomsclsa 38446  LSHypclsh 38447  LPolclpoN 40953

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-fv 6556  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8847  df-lpolN 40954

This theorem is referenced by: (None)