Theorem lcvnbtwn 39649

Description: The covers relation implies no in-betweenness. (cvnbtwn 32489 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	⊢ (𝜑 → 𝑅𝐶𝑇)

Assertion

Ref	Expression
lcvnbtwn	⊢ (𝜑 → ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇))

Proof of Theorem lcvnbtwn

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lcvnbtwn.d	. . . 4 ⊢ (𝜑 → 𝑅𝐶𝑇)
2		lcvnbtwn.s	. . . . 5 ⊢ 𝑆 = (LSubSp‘𝑊)
3		lcvnbtwn.c	. . . . 5 ⊢ 𝐶 = ( ⋖L ‘𝑊)
4		lcvnbtwn.w	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
5		lcvnbtwn.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
6		lcvnbtwn.t	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
7	2, 3, 4, 5, 6	lcvbr 39645	. . . 4 ⊢ (𝜑 → (𝑅𝐶𝑇 ↔ (𝑅 ⊊ 𝑇 ∧ ¬ ∃𝑢 ∈ 𝑆 (𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇))))
8	1, 7	mpbid 234	. . 3 ⊢ (𝜑 → (𝑅 ⊊ 𝑇 ∧ ¬ ∃𝑢 ∈ 𝑆 (𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇)))
9	8	simprd 499	. 2 ⊢ (𝜑 → ¬ ∃𝑢 ∈ 𝑆 (𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇))
10		lcvnbtwn.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
11		psseq2 4044	. . . . 5 ⊢ (𝑢 = 𝑈 → (𝑅 ⊊ 𝑢 ↔ 𝑅 ⊊ 𝑈))
12		psseq1 4043	. . . . 5 ⊢ (𝑢 = 𝑈 → (𝑢 ⊊ 𝑇 ↔ 𝑈 ⊊ 𝑇))
13	11, 12	anbi12d 641	. . . 4 ⊢ (𝑢 = 𝑈 → ((𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)))
14	13	rspcev 3581	. . 3 ⊢ ((𝑈 ∈ 𝑆 ∧ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) → ∃𝑢 ∈ 𝑆 (𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇))
15	10, 14	sylan 589	. 2 ⊢ ((𝜑 ∧ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) → ∃𝑢 ∈ 𝑆 (𝑅 ⊊ 𝑢 ∧ 𝑢 ⊊ 𝑇))
16	9, 15	mtand 825	1 ⊢ (𝜑 → ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1560   ∈ wcel 2142  ∃wrex 3086   ⊊ wpss 3905   class class class wbr 5100  ‘cfv 6521  LSubSpclss 20998   ⋖_L clcv 39642

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-iota 6477  df-fun 6523  df-fv 6529  df-lcv 39643

This theorem is referenced by:  lcvntr  39650  lcvnbtwn2  39651  lcvnbtwn3  39652