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

Theorem supcli 2164
Description: A supremum belongs to its base class (closure law).
Hypotheses
Ref Expression
sup.1 |- R Or A
sup.2 |- E.x e. A (A.y e. B -. xRy /\ A.y e. A (yRx -> E.z e. B yRz))
Assertion
Ref Expression
supcli |- sup(B, A, R) e. A
Distinct variable group(s):   x,y,z,A   x,R,y,z   x,B,y,z

Proof of Theorem supcli
StepHypRef Expression
1 sup.2 . 2 |- E.x e. A (A.y e. B -. xRy /\ A.y e. A (yRx -> E.z e. B yRz))
2 sup.1 . . 3 |- R Or A
32supcl 2159 . 2 |- (E.x e. A (A.y e. B -. xRy /\ A.y e. A (yRx -> E.z e. B yRz)) -> sup(B, A, R) e. A)
41, 3ax-mp 6 1 |- sup(B, A, R) e. A
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   e. wcel 1092  A.wral 1201  E.wrex 1202   class class class wbr 2054   Or wor 2059  supcsup 2060
This theorem is referenced by:  suprcli 4516  sqrlem7 4737  projlem9 5201
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-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-po 2128  df-so 2138  df-sup 2154
metamath.org