Theorem cvnbtwn3 30059

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

Assertion

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

Proof of Theorem cvnbtwn3

Step	Hyp	Ref	Expression
1		cvnbtwn 30057	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))
2		iman 404	. . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐴 = 𝐶) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
3		eqcom 2828	. . . 4 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶)
4	3	imbi2i 338	. . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐴 = 𝐶))
5		dfpss2 4062	. . . . . 6 ⊢ (𝐴 ⊊ 𝐶 ↔ (𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶))
6	5	anbi1i 625	. . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ 𝐶 ⊊ 𝐵))
7		an32 644	. . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
8	6, 7	bitri 277	. . . 4 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
9	8	notbii 322	. . 3 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
10	2, 4, 9	3bitr4ri 306	. 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴))
11	1, 10	syl6ib 253	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   ⊆ wss 3936   ⊊ wpss 3937   class class class wbr 5059   C_ℋ cch 28700   ⋖_ℋ ccv 28735

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pr 5322

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-br 5060  df-opab 5122  df-cv 30050

This theorem is referenced by:  atcveq0  30119  atcvatlem  30156