lcvntr - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcvntr		Structured version Visualization version GIF version

Theorem lcvntr 40083

Description: The covers relation is not transitive. (cvntr 32894 analog.) (Contributed by NM, 10-Jan-2015.)

**Hypotheses**
Ref	Expression
lcvnbtwn.s	⊢ 𝑆 = (LSubSp‘𝑊)
lcvnbtwn.c	⊢ 𝐶 = ( ⋖_L ‘𝑊)
lcvnbtwn.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)
lcvnbtwn.r	⊢ (𝜑 → 𝑅 ∈ 𝑆)
lcvnbtwn.t	⊢ (𝜑 → 𝑇 ∈ 𝑆)
lcvnbtwn.u	⊢ (𝜑 → 𝑈 ∈ 𝑆)
lcvnbtwn.d	⊢ (𝜑 → 𝑅𝐶𝑇)
lcvntr.p	⊢ (𝜑 → 𝑇𝐶𝑈)

**Assertion**
Ref	Expression
lcvntr	⊢ (𝜑 → ¬ 𝑅𝐶𝑈)

**Proof of Theorem lcvntr**
Step	Hyp	Ref	Expression
1		lcvnbtwn.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑊)
2		lcvnbtwn.c	. . . 4 ⊢ 𝐶 = ( ⋖_L ‘𝑊)
3		lcvnbtwn.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
4		lcvnbtwn.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
5		lcvnbtwn.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
6		lcvnbtwn.d	. . . 4 ⊢ (𝜑 → 𝑅𝐶𝑇)
7	1, 2, 3, 4, 5, 6	lcvpss 40081	. . 3 ⊢ (𝜑 → 𝑅 ⊊ 𝑇)
8		lcvnbtwn.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
9		lcvntr.p	. . . 4 ⊢ (𝜑 → 𝑇𝐶𝑈)
10	1, 2, 3, 5, 8, 9	lcvpss 40081	. . 3 ⊢ (𝜑 → 𝑇 ⊊ 𝑈)
11	7, 10	jca 521	. 2 ⊢ (𝜑 → (𝑅 ⊊ 𝑇 ∧ 𝑇 ⊊ 𝑈))
12	3	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → 𝑊 ∈ 𝑋)
13	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → 𝑅 ∈ 𝑆)
14	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → 𝑈 ∈ 𝑆)
15	5	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → 𝑇 ∈ 𝑆)
16		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → 𝑅𝐶𝑈)
17	1, 2, 12, 13, 14, 15, 16	lcvnbtwn 40082	. . 3 ⊢ ((𝜑 ∧ 𝑅𝐶𝑈) → ¬ (𝑅 ⊊ 𝑇 ∧ 𝑇 ⊊ 𝑈))
18	17	ex 418	. 2 ⊢ (𝜑 → (𝑅𝐶𝑈 → ¬ (𝑅 ⊊ 𝑇 ∧ 𝑇 ⊊ 𝑈)))
19	11, 18	mt2d 137	1 ⊢ (𝜑 → ¬ 𝑅𝐶𝑈)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊊ wpss 3900 class class class wbr 5103 ‘cfv 6538 LSubSpclss 21206 ⋖_L clcv 40075

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6494 df-fun 6540 df-fv 6546 df-lcv 40076

This theorem is used by: lsatcv0eq 40104

W3C validator