Theorem dedalg 10676

Description: A deductive system is an "algebra".

Assertion

Ref	Expression
dedalg	|- (T e. Ded -> T e. Alg)

Proof of Theorem dedalg

Step	Hyp	Ref	Expression
1		relded 10673	. . . . 5 |- Rel Ded
2		reldded 10674	. . . . 5 |- Rel dom Ded
3		relrded 10675	. . . . 5 |- Rel ran Ded
4	1, 2, 3	3pm3.2i 818	. . . 4 |- (Rel Ded /\ Rel dom Ded /\ Rel ran Ded)
5		11st22nd 10458	. . . 4 |- (((Rel Ded /\ Rel dom Ded /\ Rel ran Ded) /\ T e. Ded) -> T = <.<.(1st` (1st` T)), (2nd` (1st` T))>., <.(1st` (2nd` T)), (2nd` (2nd` T))>.>.)
6	4, 5	mpan 695	. . 3 |- (T e. Ded -> T = <.<.(1st` (1st` T)), (2nd` (1st` T))>., <.(1st` (2nd` T)), (2nd` (2nd` T))>.>.)
7		eqid 1475	. . . . . 6 |- (dom` T) = (dom` T)
8	7	domval 10655	. . . . 5 |- (dom` T) = (1st` (1st` T))
9		eqid 1475	. . . . . 6 |- (cod` T) = (cod` T)
10	9	codval 10656	. . . . 5 |- (cod` T) = (2nd` (1st` T))
11	8, 10	opeq12i 2492	. . . 4 |- <.(dom` T), (cod` T)>. = <.(1st` (1st` T)), (2nd` (1st` T))>.
12		eqid 1475	. . . . . 6 |- (id` T) = (id` T)
13	12	idval 10657	. . . . 5 |- (id` T) = (1st` (2nd` T))
14		eqid 1475	. . . . . 6 |- (o` T) = (o` T)
15	14	cmpval 10658	. . . . 5 |- (o` T) = (2nd` (2nd` T))
16	13, 15	opeq12i 2492	. . . 4 |- <.(id` T), (o` T)>. = <.(1st` (2nd` T)), (2nd` (2nd` T))>.
17	11, 16	opeq12i 2492	. . 3 |- <.<.(dom` T), (cod` T)>., <.(id` T), (o` T)>.>. = <.<.(1st` (1st` T)), (2nd` (1st` T))>., <.(1st` (2nd` T)), (2nd` (2nd` T))>.>.
18	6, 17	syl6eqr 1525	. 2 |- (T e. Ded -> T = <.<.(dom` T), (cod` T)>., <.(id` T), (o` T)>.>.)
19		eqid 1475	. . . . 5 |- dom (dom` T) = dom (dom` T)
20		eqid 1475	. . . . 5 |- dom (id` T) = dom (id` T)
21	7, 9, 12, 14, 19, 20	dedi 10670	. . . 4 |- (T e. Ded -> ((<.<.(dom` T), (cod` T)>., <.(id` T), (o` T)>.>. e. Alg /\ A.z e. dom (id` T)(((dom` T)` ((id` T)` z)) = z /\ ((cod` T)` ((id` T)` z)) = z) /\ A.x e. dom (dom` T)A.y e. dom (dom` T)(<.y, x>. e. dom (o` T) <-> ((dom` T)` y) = ((cod` T)` x))) /\ (A.x e. dom (dom` T)A.y e. dom (dom` T)(((dom` T)` y) = ((cod` T)` x) -> ((dom` T)` (y(o` T)x)) = ((dom` T)` x)) /\ A.x e. dom (dom` T)A.y e. dom (dom` T)(((dom` T)` y) = ((cod` T)` x) -> ((cod` T)` (y(o` T)x)) = ((cod` T)` y)))))
22	21	pm3.26d 321	. . 3 |- (T e. Ded -> (<.<.(dom` T), (cod` T)>., <.(id` T), (o` T)>.>. e. Alg /\ A.z e. dom (id` T)(((dom` T)` ((id` T)` z)) = z /\ ((cod` T)` ((id` T)` z)) = z) /\ A.x e. dom (dom` T)A.y e. dom (dom` T)(<.y, x>. e. dom (o` T) <-> ((dom` T)` y) = ((cod` T)` x))))
23	22	3simp1d 794	. 2 |- (T e. Ded -> <.<.(dom` T), (cod` T)>., <.(id` T), (o` T)>.>. e. Alg)
24	18, 23	eqeltrd 1548	1 |- (T e. Ded -> T e. Alg)

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   /\ w3a 775   = wceq 956   e. wcel 958  A.wral 1645  <.cop 2411  dom cdm 3170  ran crn 3171  Rel wrel 3175  ` cfv 3182  (class class class)co 3963  1stc1st 4077  2ndc2nd 4078  Algcalg 10643  domcdom_ 10644  codccod_ 10645  idcid_ 10646  oco_ 10647  Dedcded 10667

This theorem is referenced by:  rdmob 10681  rcmob 10682  aidm 10683  aidmold 10684  domc 10698  codc 10699  idc 10700  cmppfc 10701  mrdmcd 10722

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-9 965  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-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866

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-ral 1649  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-int 2534  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-fo 3196  df-fv 3198  df-opr 3965  df-1st 4079  df-2nd 4080  df-doma 10649  df-coda 10650  df-ida 10651  df-cmpa 10652  df-ded 10668

Copyright terms: Public domain