Theorem lcvnbtwn2 39691

Description: The covers relation implies no in-betweenness. (cvnbtwn2 32580 analog.) (Contributed by NM, 7-Jan-2015.)

Hypotheses

Ref	Expression
lcvnbtwn.s	⊢ 𝑆 = (LSubSp‘𝑊)
lcvnbtwn.c	⊢ 𝐶 = ( ⋖L ‘𝑊)
lcvnbtwn.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)
lcvnbtwn.r	⊢ (𝜑 → 𝑅 ∈ 𝑆)
lcvnbtwn.t	⊢ (𝜑 → 𝑇 ∈ 𝑆)
lcvnbtwn.u	⊢ (𝜑 → 𝑈 ∈ 𝑆)
lcvnbtwn.d	⊢ (𝜑 → 𝑅𝐶𝑇)
lcvnbtwn2.p	⊢ (𝜑 → 𝑅 ⊊ 𝑈)
lcvnbtwn2.q	⊢ (𝜑 → 𝑈 ⊆ 𝑇)

Assertion

Ref	Expression
lcvnbtwn2	⊢ (𝜑 → 𝑈 = 𝑇)

Proof of Theorem lcvnbtwn2

Step	Hyp	Ref	Expression
1		lcvnbtwn2.p	. 2 ⊢ (𝜑 → 𝑅 ⊊ 𝑈)
2		lcvnbtwn2.q	. 2 ⊢ (𝜑 → 𝑈 ⊆ 𝑇)
3		lcvnbtwn.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑊)
4		lcvnbtwn.c	. . . 4 ⊢ 𝐶 = ( ⋖L ‘𝑊)
5		lcvnbtwn.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
6		lcvnbtwn.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
7		lcvnbtwn.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
8		lcvnbtwn.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
9		lcvnbtwn.d	. . . 4 ⊢ (𝜑 → 𝑅𝐶𝑇)
10	3, 4, 5, 6, 7, 8, 9	lcvnbtwn 39689	. . 3 ⊢ (𝜑 → ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇))
11		iman 406	. . . 4 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇) ↔ ¬ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇))
12		anass 473	. . . . . 6 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇)))
13		dfpss2 4050	. . . . . . 7 ⊢ (𝑈 ⊊ 𝑇 ↔ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇))
14	13	anbi2i 634	. . . . . 6 ⊢ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇)))
15	12, 14	bitr4i 281	. . . . 5 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇))
16	15	notbii 323	. . . 4 ⊢ (¬ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇))
17	11, 16	bitr2i 279	. . 3 ⊢ (¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇))
18	10, 17	sylib 221	. 2 ⊢ (𝜑 → ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇))
19	1, 2, 18	mp2and 711	1 ⊢ (𝜑 → 𝑈 = 𝑇)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149   ⊆ wss 3913   ⊊ wpss 3914   class class class wbr 5113  ‘cfv 6537  LSubSpclss 21030   ⋖_L clcv 39682

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-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  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-iota 6493  df-fun 6539  df-fv 6545  df-lcv 39683

This theorem is referenced by:  lcvat  39694  lsatexch  39707