Theorem cvnbtwn2 32769

Description: The covers relation implies no in-betweenness. (Contributed by NM, 12-Jun-2004.) (New usage is discouraged.)

Assertion

Ref	Expression
cvnbtwn2	⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵)))

Proof of Theorem cvnbtwn2

Step	Hyp	Ref	Expression
1		cvnbtwn 32768	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))
2		iman 407	. . 3 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵) ↔ ¬ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵))
3		anass 474	. . . . 5 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)))
4		dfpss2 4036	. . . . . 6 ⊢ (𝐶 ⊊ 𝐵 ↔ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))
5	4	anbi2i 635	. . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)))
6	3, 5	bitr4i 281	. . . 4 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))
7	6	notbii 323	. . 3 ⊢ (¬ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))
8	2, 7	bitr2i 279	. 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵))
9	1, 8	imbitrdi 254	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899   ⊊ wpss 3900   class class class wbr 5103   C_ℋ cch 31411   ⋖_ℋ ccv 31446

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-ext 2732  ax-sep 5251  ax-pr 5398

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-cv 32761

This theorem is used by:  cvati  32848  cvexchlem  32850  atexch  32863