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

Theorem rcla4eopr 3990
Description: A frequently used special case of rcla42ev 1881 for operation values.
Assertion
Ref Expression
rcla4eopr |- ((C e. A /\ D e. B /\ S = (CFD)) -> E.x e. A E.y e. B S = (xFy))
Distinct variable groups:   x,A   x,y,B   x,C,y   y,D   x,F,y   x,S,y

Proof of Theorem rcla4eopr
StepHypRef Expression
1 opreq1 3968 . . 3 |- (x = C -> (xFy) = (CFy))
21eqeq2d 1486 . 2 |- (x = C -> (S = (xFy) <-> S = (CFy)))
3 opreq2 3969 . . 3 |- (y = D -> (CFy) = (CFD))
43eqeq2d 1486 . 2 |- (y = D -> (S = (CFy) <-> S = (CFD)))
52, 4rcla42ev 1881 1 |- ((C e. A /\ D e. B /\ S = (CFD)) -> E.x e. A E.y e. B S = (xFy))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ w3a 775   = wceq 956   e. wcel 958  E.wrex 1646  (class class class)co 3963
This theorem is referenced by:  znq 6258  qaddclt 6269  qnegclt 6270  qmulclt 6271  qrecclt 6273  isgrpi 8042  pjthlem14 9232  pjpjtht 9258  shscl 9281  shsvat 9284  shunss 9337  spanunsn 9502  pjjs 9645
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-xp 3184  df-cnv 3186  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fv 3198  df-opr 3965
Copyright terms: Public domain