Theorem supsnti 7064

Description: The supremum of a singleton. (Contributed by Jim Kingdon, 26-Nov-2021.)

Hypotheses

Ref	Expression
supsnti.ti	|- ( ( ph /\ ( u e. A /\ v e. A ) ) -> ( u = v <-> ( -. u R v /\ -. v R u ) ) )
supsnti.b	|- ( ph -> B e. A )

Assertion

Ref	Expression
supsnti	|- ( ph -> sup ( { B } , A , R ) = B )

Distinct variable groups:   u, A, v   u, B, v   u, R, v   ph, u, v

Proof of Theorem supsnti

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		supsnti.ti	. 2 |- ( ( ph /\ ( u e. A /\ v e. A ) ) -> ( u = v <-> ( -. u R v /\ -. v R u ) ) )
2		supsnti.b	. 2 |- ( ph -> B e. A )
3		snidg 3647	. . 3 |- ( B e. A -> B e. { B } )
4	2, 3	syl 14	. 2 |- ( ph -> B e. { B } )
5		eqid 2193	. . . . . 6 |- B = B
6	1	ralrimivva 2576	. . . . . . 7 |- ( ph -> A. u e. A A. v e. A ( u = v <-> ( -. u R v /\ -. v R u ) ) )
7		eqeq1 2200	. . . . . . . . . 10 |- ( u = B -> ( u = v <-> B = v ) )
8		breq1 4032	. . . . . . . . . . . 12 |- ( u = B -> ( u R v <-> B R v ) )
9	8	notbid 668	. . . . . . . . . . 11 |- ( u = B -> ( -. u R v <-> -. B R v ) )
10		breq2 4033	. . . . . . . . . . . 12 |- ( u = B -> ( v R u <-> v R B ) )
11	10	notbid 668	. . . . . . . . . . 11 |- ( u = B -> ( -. v R u <-> -. v R B ) )
12	9, 11	anbi12d 473	. . . . . . . . . 10 |- ( u = B -> ( ( -. u R v /\ -. v R u ) <-> ( -. B R v /\ -. v R B ) ) )
13	7, 12	bibi12d 235	. . . . . . . . 9 |- ( u = B -> ( ( u = v <-> ( -. u R v /\ -. v R u ) ) <-> ( B = v <-> ( -. B R v /\ -. v R B ) ) ) )
14		eqeq2 2203	. . . . . . . . . 10 |- ( v = B -> ( B = v <-> B = B ) )
15		breq2 4033	. . . . . . . . . . . 12 |- ( v = B -> ( B R v <-> B R B ) )
16	15	notbid 668	. . . . . . . . . . 11 |- ( v = B -> ( -. B R v <-> -. B R B ) )
17		breq1 4032	. . . . . . . . . . . 12 |- ( v = B -> ( v R B <-> B R B ) )
18	17	notbid 668	. . . . . . . . . . 11 |- ( v = B -> ( -. v R B <-> -. B R B ) )
19	16, 18	anbi12d 473	. . . . . . . . . 10 |- ( v = B -> ( ( -. B R v /\ -. v R B ) <-> ( -. B R B /\ -. B R B ) ) )
20	14, 19	bibi12d 235	. . . . . . . . 9 |- ( v = B -> ( ( B = v <-> ( -. B R v /\ -. v R B ) ) <-> ( B = B <-> ( -. B R B /\ -. B R B ) ) ) )
21	13, 20	rspc2v 2877	. . . . . . . 8 |- ( ( B e. A /\ B e. A ) -> ( A. u e. A A. v e. A ( u = v <-> ( -. u R v /\ -. v R u ) ) -> ( B = B <-> ( -. B R B /\ -. B R B ) ) ) )
22	2, 2, 21	syl2anc 411	. . . . . . 7 |- ( ph -> ( A. u e. A A. v e. A ( u = v <-> ( -. u R v /\ -. v R u ) ) -> ( B = B <-> ( -. B R B /\ -. B R B ) ) ) )
23	6, 22	mpd 13	. . . . . 6 |- ( ph -> ( B = B <-> ( -. B R B /\ -. B R B ) ) )
24	5, 23	mpbii 148	. . . . 5 |- ( ph -> ( -. B R B /\ -. B R B ) )
25	24	simpld 112	. . . 4 |- ( ph -> -. B R B )
26	25	adantr 276	. . 3 |- ( ( ph /\ x e. { B } ) -> -. B R B )
27		elsni 3636	. . . . . 6 |- ( x e. { B } -> x = B )
28	27	breq2d 4041	. . . . 5 |- ( x e. { B } -> ( B R x <-> B R B ) )
29	28	notbid 668	. . . 4 |- ( x e. { B } -> ( -. B R x <-> -. B R B ) )
30	29	adantl 277	. . 3 |- ( ( ph /\ x e. { B } ) -> ( -. B R x <-> -. B R B ) )
31	26, 30	mpbird 167	. 2 |- ( ( ph /\ x e. { B } ) -> -. B R x )
32	1, 2, 4, 31	supmaxti 7063	1 |- ( ph -> sup ( { B } , A , R ) = B )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2164   A.wral 2472   {csn 3618   class class class wbr 4029   supcsup 7041

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-un 3157  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-iota 5215  df-riota 5873  df-sup 7043

This theorem is referenced by:  infsnti  7089