ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  trlsegvdeglem4 Unicode version

Theorem trlsegvdeglem4 16704
Description: Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.)
Hypotheses
Ref Expression
trlsegvdeg.v  |-  V  =  (Vtx `  G )
trlsegvdeg.i  |-  I  =  (iEdg `  G )
trlsegvdeg.f  |-  ( ph  ->  Fun  I )
trlsegvdeg.n  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
trlsegvdeg.u  |-  ( ph  ->  U  e.  V )
trlsegvdeg.w  |-  ( ph  ->  F (Trails `  G
) P )
trlsegvdeg.vx  |-  ( ph  ->  (Vtx `  X )  =  V )
trlsegvdeg.vy  |-  ( ph  ->  (Vtx `  Y )  =  V )
trlsegvdeg.vz  |-  ( ph  ->  (Vtx `  Z )  =  V )
trlsegvdeg.ix  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
trlsegvdeg.iy  |-  ( ph  ->  (iEdg `  Y )  =  { <. ( F `  N ) ,  ( I `  ( F `
 N ) )
>. } )
trlsegvdeg.iz  |-  ( ph  ->  (iEdg `  Z )  =  ( I  |`  ( F " ( 0 ... N ) ) ) )
Assertion
Ref Expression
trlsegvdeglem4  |-  ( ph  ->  dom  (iEdg `  X
)  =  ( ( F " ( 0..^ N ) )  i^i 
dom  I ) )

Proof of Theorem trlsegvdeglem4
StepHypRef Expression
1 trlsegvdeg.ix . . 3  |-  ( ph  ->  (iEdg `  X )  =  ( I  |`  ( F " ( 0..^ N ) ) ) )
21dmeqd 4983 . 2  |-  ( ph  ->  dom  (iEdg `  X
)  =  dom  (
I  |`  ( F "
( 0..^ N ) ) ) )
3 dmres 5084 . 2  |-  dom  (
I  |`  ( F "
( 0..^ N ) ) )  =  ( ( F " (
0..^ N ) )  i^i  dom  I )
42, 3eqtrdi 2287 1  |-  ( ph  ->  dom  (iEdg `  X
)  =  ( ( F " ( 0..^ N ) )  i^i 
dom  I ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209    i^i cin 3219   {csn 3709   <.cop 3712   class class class wbr 4130   dom cdm 4774    |` cres 4776   "cima 4777   Fun wfun 5371   ` cfv 5377  (class class class)co 6085   0cc0 8179   ...cfz 10411  ..^cfzo 10549  ♯chash 11214  Vtxcvtx 16253  iEdgciedg 16254  Trailsctrls 16621
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-dm 4784  df-res 4786
This theorem is used by:  trlsegvdeglem6  16706  trlsegvdegfi  16708
  Copyright terms: Public domain W3C validator