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

Theorem ecopoprdm 5368
Description: Assuming the operation F is commutative, compute the domain the relation R specified by the first hypothesis.
Hypotheses
Ref Expression
ecopopr.1 |- R = {<.x, y>. | ((x e. (S X. S) /\ y e. (S X. S)) /\ E.zE.wE.vE.u((x = <.z, w>. /\ y = <.v, u>.) /\ (zFu) = (wFv)))}
ecopopr.com |- (xFy) = (yFx)
Assertion
Ref Expression
ecopoprdm |- dom R = (S X. S)
Distinct variable groups:   x,y,z,w,v,u,F   x,S,y,z,w,v,u

Proof of Theorem ecopoprdm
StepHypRef Expression
1 ecopopr.1 . . . . 5 |- R = {<.x, y>. | ((x e. (S X. S) /\ y e. (S X. S)) /\ E.zE.wE.vE.u((x = <.z, w>. /\ y = <.v, u>.) /\ (zFu) = (wFv)))}
2 opabssxp 4060 . . . . 5 |- {<.x, y>. | ((x e. (S X. S) /\ y e. (S X. S)) /\ E.zE.wE.vE.u((x = <.z, w>. /\ y = <.v, u>.) /\ (zFu) = (wFv)))} C_ ((S X. S) X. (S X. S))
31, 2eqsstri 2647 . . . 4 |- R C_ ((S X. S) X. (S X. S))
4 dmss 4156 . . . 4 |- (R C_ ((S X. S) X. (S X. S)) -> dom R C_ dom ((S X. S) X. (S X. S)))
53, 4ax-mp 7 . . 3 |- dom R C_ dom ((S X. S) X. (S X. S))
6 dmxpid 4179 . . 3 |- dom ((S X. S) X. (S X. S)) = (S X. S)
75, 6sseqtri 2649 . 2 |- dom R C_ (S X. S)
8 relxp 4088 . . 3 |- Rel (S X. S)
9 visset 2295 . . . . 5 |- g e. _V
109opelxp 4036 . . . 4 |- (<.f, g>. e. (S X. S) <-> (f e. S /\ g e. S))
11 visset 2295 . . . . . . . 8 |- f e. _V
12 ecopopr.com . . . . . . . 8 |- (xFy) = (yFx)
1311, 9, 12caoprcom 4986 . . . . . . 7 |- (fFg) = (gFf)
141ecopopreq 5367 . . . . . . . 8 |- (((f e. S /\ g e. S) /\ (f e. S /\ g e. S)) -> (<.f, g>.R<.f, g>. <-> (fFg) = (gFf)))
1514anidms 480 . . . . . . 7 |- ((f e. S /\ g e. S) -> (<.f, g>.R<.f, g>. <-> (fFg) = (gFf)))
1613, 15mpbiri 211 . . . . . 6 |- ((f e. S /\ g e. S) -> <.f, g>.R<.f, g>.)
17 df-br 3339 . . . . . 6 |- (<.f, g>.R<.f, g>. <-> <.<.f, g>., <.f, g>.>. e. R)
1816, 17sylib 215 . . . . 5 |- ((f e. S /\ g e. S) -> <.<.f, g>., <.f, g>.>. e. R)
19 opex 3527 . . . . . 6 |- <.f, g>. e. _V
2019opeldm 4160 . . . . 5 |- (<.<.f, g>., <.f, g>.>. e. R -> <.f, g>. e. dom R)
2118, 20syl 12 . . . 4 |- ((f e. S /\ g e. S) -> <.f, g>. e. dom R)
2210, 21sylbi 216 . . 3 |- (<.f, g>. e. (S X. S) -> <.f, g>. e. dom R)
238, 22relssi 4078 . 2 |- (S X. S) C_ dom R
247, 23eqssi 2632 1 |- dom R = (S X. S)
Colors of variables: wff set class
Syntax hints:   <-> wb 163   /\ wa 240   = wceq 1298   e. wcel 1300  E.wex 1326   C_ wss 2593  <.cop 3046   class class class wbr 3338  {copab 3395   X. cxp 3984  dom cdm 3986  (class class class)co 4884
This theorem is referenced by:  dmenq 6197  dmenr 6327
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-xp 4000  df-rel 4001  df-cnv 4002  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fv 4014  df-opr 4886
Copyright terms: Public domain