HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem supmo 4559
Description: Any class B has at most one supremum in A (where R is interpreted as 'less than').
Hypothesis
Ref Expression
supmo.1 R Or A
Assertion
Ref Expression
supmo ∃*x(xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz)))
Distinct variable groups:   x,y,z,A   x,R,y,z   x,B,y,z

Proof of Theorem supmo
StepHypRef Expression
1 eleq1 1532 . . . 4 (x = w → (xAwA))
2 breq1 2618 . . . . . . 7 (x = w → (xRywRy))
32negbid 610 . . . . . 6 (x = w → (¬ xRy ↔ ¬ wRy))
43ralbidv 1661 . . . . 5 (x = w → (∀yB ¬ xRy ↔ ∀yB ¬ wRy))
5 breq2 2619 . . . . . . 7 (x = w → (yRxyRw))
65imbi1d 612 . . . . . 6 (x = w → ((yRx → ∃zB yRz) ↔ (yRw → ∃zB yRz)))
76ralbidv 1661 . . . . 5 (x = w → (∀yA (yRx → ∃zB yRz) ↔ ∀yA (yRw → ∃zB yRz)))
84, 7anbi12d 627 . . . 4 (x = w → ((∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz)) ↔ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz))))
91, 8anbi12d 627 . . 3 (x = w → ((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ↔ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))))
109mo4 1402 . 2 (∃*x(xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ↔ ∀xw(((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → x = w))
11 breq1 2618 . . . . . . . . . . . . . 14 (y = x → (yRwxRw))
12 breq1 2618 . . . . . . . . . . . . . . 15 (y = x → (yRzxRz))
1312rexbidv 1662 . . . . . . . . . . . . . 14 (y = x → (∃zB yRz ↔ ∃zB xRz))
1411, 13imbi12d 625 . . . . . . . . . . . . 13 (y = x → ((yRw → ∃zB yRz) ↔ (xRw → ∃zB xRz)))
1514rcla4va 1872 . . . . . . . . . . . 12 ((xA ⋀ ∀yA (yRw → ∃zB yRz)) → (xRw → ∃zB xRz))
1615con3d 95 . . . . . . . . . . 11 ((xA ⋀ ∀yA (yRw → ∃zB yRz)) → (¬ ∃zB xRz → ¬ xRw))
1716imp 350 . . . . . . . . . 10 (((xA ⋀ ∀yA (yRw → ∃zB yRz)) ⋀ ¬ ∃zB xRz) → ¬ xRw)
18 breq2 2619 . . . . . . . . . . . . 13 (y = z → (xRyxRz))
1918negbid 610 . . . . . . . . . . . 12 (y = z → (¬ xRy ↔ ¬ xRz))
2019cbvralv 1797 . . . . . . . . . . 11 (∀yB ¬ xRy ↔ ∀zB ¬ xRz)
21 ralnex 1651 . . . . . . . . . . 11 (∀zB ¬ xRz ↔ ¬ ∃zB xRz)
2220, 21bitr 173 . . . . . . . . . 10 (∀yB ¬ xRy ↔ ¬ ∃zB xRz)
2317, 22sylan2b 452 . . . . . . . . 9 (((xA ⋀ ∀yA (yRw → ∃zB yRz)) ⋀ ∀yB ¬ xRy) → ¬ xRw)
2423an1rs 489 . . . . . . . 8 (((xA ⋀ ∀yB ¬ xRy) ⋀ ∀yA (yRw → ∃zB yRz)) → ¬ xRw)
2524adantlrr 399 . . . . . . 7 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ ∀yA (yRw → ∃zB yRz)) → ¬ xRw)
2625adantrl 394 . . . . . 6 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz))) → ¬ xRw)
2726adantrl 394 . . . . 5 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → ¬ xRw)
28 breq1 2618 . . . . . . . . . . . . . 14 (y = w → (yRxwRx))
29 breq1 2618 . . . . . . . . . . . . . . 15 (y = w → (yRzwRz))
3029rexbidv 1662 . . . . . . . . . . . . . 14 (y = w → (∃zB yRz ↔ ∃zB wRz))
3128, 30imbi12d 625 . . . . . . . . . . . . 13 (y = w → ((yRx → ∃zB yRz) ↔ (wRx → ∃zB wRz)))
3231rcla4cva 1873 . . . . . . . . . . . 12 ((∀yA (yRx → ∃zB yRz) ⋀ wA) → (wRx → ∃zB wRz))
3332con3d 95 . . . . . . . . . . 11 ((∀yA (yRx → ∃zB yRz) ⋀ wA) → (¬ ∃zB wRz → ¬ wRx))
3433imp 350 . . . . . . . . . 10 (((∀yA (yRx → ∃zB yRz) ⋀ wA) ⋀ ¬ ∃zB wRz) → ¬ wRx)
35 breq2 2619 . . . . . . . . . . . . 13 (y = z → (wRywRz))
3635negbid 610 . . . . . . . . . . . 12 (y = z → (¬ wRy ↔ ¬ wRz))
3736cbvralv 1797 . . . . . . . . . . 11 (∀yB ¬ wRy ↔ ∀zB ¬ wRz)
38 ralnex 1651 . . . . . . . . . . 11 (∀zB ¬ wRz ↔ ¬ ∃zB wRz)
3937, 38bitr 173 . . . . . . . . . 10 (∀yB ¬ wRy ↔ ¬ ∃zB wRz)
4034, 39sylan2b 452 . . . . . . . . 9 (((∀yA (yRx → ∃zB yRz) ⋀ wA) ⋀ ∀yB ¬ wRy) → ¬ wRx)
4140anasss 440 . . . . . . . 8 ((∀yA (yRx → ∃zB yRz) ⋀ (wA ⋀ ∀yB ¬ wRy)) → ¬ wRx)
4241adantrrr 403 . . . . . . 7 ((∀yA (yRx → ∃zB yRz) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → ¬ wRx)
4342adantll 392 . . . . . 6 (((∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz)) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → ¬ wRx)
4443adantll 392 . . . . 5 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → ¬ wRx)
4527, 44jca 288 . . . 4 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → (¬ xRw ⋀ ¬ wRx))
46 supmo.1 . . . . . 6 R Or A
47 sotrieq2 2858 . . . . . 6 ((R Or A ⋀ (xAwA)) → (x = w ↔ (¬ xRw ⋀ ¬ wRx)))
4846, 47mpan 694 . . . . 5 ((xAwA) → (x = w ↔ (¬ xRw ⋀ ¬ wRx)))
4948ad2ant2r 409 . . . 4 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → (x = w ↔ (¬ xRw ⋀ ¬ wRx)))
5045, 49mpbird 196 . . 3 (((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → x = w)
5150ax-gen 962 . 2 w(((xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz))) ⋀ (wA ⋀ (∀yB ¬ wRy ⋀ ∀yA (yRw → ∃zB yRz)))) → x = w)
5210, 51mpgbir 987 1 ∃*x(xA ⋀ (∀yB ¬ xRy ⋀ ∀yA (yRx → ∃zB yRz)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 2   → wi 3   ↔ wb 146   ⋀ wa 223  ∀wal 953   = wceq 955   ∈ wcel 957  ∃*wmo 1380  ∀wral 1643  ∃wrex 1644   class class class wbr 2615   Or wor 2835
This theorem is referenced by:  supex 4560  supeu 4561  suppr 4573  supsnALT 4575
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ral 1647  df-rex 1648  df-v 1809  df-un 2047  df-sn 2409  df-pr 2410  df-op 2413  df-br 2616  df-po 2836  df-so 2846
Copyright terms: Public domain