Theorem cvnbtwn2t 5719

Description: The covering relation implies no in-betweenness.

Assertion

Ref	Expression
cvnbtwn2t	|- ((A e. CH /\ B e. CH /\ C e. CH) -> (A <o B -> ((A (. C /\ C (_ B) -> C = B)))

Proof of Theorem cvnbtwn2t

Step	Hyp	Ref	Expression
1		cvnbtwnt 5718	. 2 |- ((A e. CH /\ B e. CH /\ C e. CH) -> (A <o B -> -. (A (. C /\ C (. B)))
2		iman 205	. . 3 |- (((A (. C /\ C (_ B) -> C = B) <-> -. ((A (. C /\ C (_ B) /\ -. C = B))
3		anass 336	. . . . 5 |- (((A (. C /\ C (_ B) /\ -. C = B) <-> (A (. C /\ (C (_ B /\ -. C = B)))
4		dfpss2 1557	. . . . . 6 |- (C (. B <-> (C (_ B /\ -. C = B))
5	4	anbi2i 367	. . . . 5 |- ((A (. C /\ C (. B) <-> (A (. C /\ (C (_ B /\ -. C = B)))
6	3, 5	bitr4 154	. . . 4 |- (((A (. C /\ C (_ B) /\ -. C = B) <-> (A (. C /\ C (. B))
7	6	negbii 162	. . 3 |- (-. ((A (. C /\ C (_ B) /\ -. C = B) <-> -. (A (. C /\ C (. B))
8	2, 7	bitr2 152	. 2 |- (-. (A (. C /\ C (. B) <-> ((A (. C /\ C (_ B) -> C = B))
9	1, 8	syl6ib 185	1 |- ((A e. CH /\ B e. CH /\ C e. CH) -> (A <o B -> ((A (. C /\ C (_ B) -> C = B)))

Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   /\ w3a 581   = wceq 1091   e. wcel 1092   (_ wss 1487   (. wpss 1488   class class class wbr 2054  CHcch 4968   <o ccv 4981

This theorem is referenced by:  cvexchlem 5759  atexch 5769

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-cv 5712

metamath.org