Theorem sosng 4684

Description: Strict linear ordering on a singleton. (Contributed by Jim Kingdon, 5-Dec-2018.)

Assertion

Ref	Expression
sosng	|- ( ( Rel R /\ A e. _V ) -> ( R Or { A } <-> -. A R A ) )

Proof of Theorem sosng

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sopo 4298	. . 3 |- ( R Or { A } -> R Po { A } )
2		posng 4683	. . 3 |- ( ( Rel R /\ A e. _V ) -> ( R Po { A } <-> -. A R A ) )
3	1, 2	syl5ib 153	. 2 |- ( ( Rel R /\ A e. _V ) -> ( R Or { A } -> -. A R A ) )
4	2	biimpar 295	. . . 4 |- ( ( ( Rel R /\ A e. _V ) /\ -. A R A ) -> R Po { A } )
5		ax-in2 610	. . . . . . . . 9 |- ( -. A R A -> ( A R A -> ( x R z \/ z R y ) ) )
6	5	adantr 274	. . . . . . . 8 |- ( ( -. A R A /\ ( x e. { A } /\ y e. { A } ) ) -> ( A R A -> ( x R z \/ z R y ) ) )
7		elsni 3601	. . . . . . . . . . 11 |- ( x e. { A } -> x = A )
8		elsni 3601	. . . . . . . . . . 11 |- ( y e. { A } -> y = A )
9	7, 8	breqan12d 4005	. . . . . . . . . 10 |- ( ( x e. { A } /\ y e. { A } ) -> ( x R y <-> A R A ) )
10	9	imbi1d 230	. . . . . . . . 9 |- ( ( x e. { A } /\ y e. { A } ) -> ( ( x R y -> ( x R z \/ z R y ) ) <-> ( A R A -> ( x R z \/ z R y ) ) ) )
11	10	adantl 275	. . . . . . . 8 |- ( ( -. A R A /\ ( x e. { A } /\ y e. { A } ) ) -> ( ( x R y -> ( x R z \/ z R y ) ) <-> ( A R A -> ( x R z \/ z R y ) ) ) )
12	6, 11	mpbird 166	. . . . . . 7 |- ( ( -. A R A /\ ( x e. { A } /\ y e. { A } ) ) -> ( x R y -> ( x R z \/ z R y ) ) )
13	12	ralrimivw 2544	. . . . . 6 |- ( ( -. A R A /\ ( x e. { A } /\ y e. { A } ) ) -> A. z e. { A } ( x R y -> ( x R z \/ z R y ) ) )
14	13	ralrimivva 2552	. . . . 5 |- ( -. A R A -> A. x e. { A } A. y e. { A } A. z e. { A } ( x R y -> ( x R z \/ z R y ) ) )
15	14	adantl 275	. . . 4 |- ( ( ( Rel R /\ A e. _V ) /\ -. A R A ) -> A. x e. { A } A. y e. { A } A. z e. { A } ( x R y -> ( x R z \/ z R y ) ) )
16		df-iso 4282	. . . 4 |- ( R Or { A } <-> ( R Po { A } /\ A. x e. { A } A. y e. { A } A. z e. { A } ( x R y -> ( x R z \/ z R y ) ) ) )
17	4, 15, 16	sylanbrc 415	. . 3 |- ( ( ( Rel R /\ A e. _V ) /\ -. A R A ) -> R Or { A } )
18	17	ex 114	. 2 |- ( ( Rel R /\ A e. _V ) -> ( -. A R A -> R Or { A } ) )
19	3, 18	impbid 128	1 |- ( ( Rel R /\ A e. _V ) -> ( R Or { A } <-> -. A R A ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 703   e. wcel 2141   A.wral 2448   _Vcvv 2730   {csn 3583   class class class wbr 3989   Po wpo 4279   Or wor 4280   Rel wrel 4616

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-v 2732  df-sbc 2956  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-po 4281  df-iso 4282

This theorem is referenced by: (None)