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

Theorem subumgr 16395
Description: A subgraph of a multigraph is a multigraph. (Contributed by AV, 26-Nov-2020.)
Assertion
Ref Expression
subumgr  |-  ( ( G  e. UMGraph  /\  S SubGraph  G )  ->  S  e. UMGraph )

Proof of Theorem subumgr
Dummy variables  x  e are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2234 . . . 4  |-  (Vtx `  S )  =  (Vtx
`  S )
2 eqid 2234 . . . 4  |-  (Vtx `  G )  =  (Vtx
`  G )
3 eqid 2234 . . . 4  |-  (iEdg `  S )  =  (iEdg `  S )
4 eqid 2234 . . . 4  |-  (iEdg `  G )  =  (iEdg `  G )
5 eqid 2234 . . . 4  |-  (Edg `  S )  =  (Edg
`  S )
61, 2, 3, 4, 5subgrprop2 16381 . . 3  |-  ( S SubGraph  G  ->  ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_  ~P (Vtx `  S ) ) )
7 umgruhgr 16234 . . . . . . . . . 10  |-  ( G  e. UMGraph  ->  G  e. UHGraph )
8 subgruhgrfun 16389 . . . . . . . . . 10  |-  ( ( G  e. UHGraph  /\  S SubGraph  G )  ->  Fun  (iEdg `  S
) )
97, 8sylan 283 . . . . . . . . 9  |-  ( ( G  e. UMGraph  /\  S SubGraph  G )  ->  Fun  (iEdg `  S
) )
109ancoms 268 . . . . . . . 8  |-  ( ( S SubGraph  G  /\  G  e. UMGraph )  ->  Fun  (iEdg `  S
) )
1110funfnd 5388 . . . . . . 7  |-  ( ( S SubGraph  G  /\  G  e. UMGraph )  ->  (iEdg `  S
)  Fn  dom  (iEdg `  S ) )
1211adantl 277 . . . . . 6  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  (iEdg `  S )  Fn  dom  (iEdg `  S ) )
13 simplrl 537 . . . . . . . . 9  |-  ( ( ( ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  /\  x  e.  dom  (iEdg `  S ) )  ->  S SubGraph  G )
14 simplrr 538 . . . . . . . . 9  |-  ( ( ( ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  /\  x  e.  dom  (iEdg `  S ) )  ->  G  e. UMGraph )
15 simpr 110 . . . . . . . . 9  |-  ( ( ( ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  /\  x  e.  dom  (iEdg `  S ) )  ->  x  e.  dom  (iEdg `  S ) )
161, 3subumgredg2en 16392 . . . . . . . . 9  |-  ( ( S SubGraph  G  /\  G  e. UMGraph  /\  x  e.  dom  (iEdg `  S ) )  ->  ( (iEdg `  S ) `  x
)  e.  { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )
1713, 14, 15, 16syl3anc 1274 . . . . . . . 8  |-  ( ( ( ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  /\  x  e.  dom  (iEdg `  S ) )  ->  ( (iEdg `  S ) `  x
)  e.  { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )
1817ralrimiva 2617 . . . . . . 7  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  A. x  e.  dom  (iEdg `  S
) ( (iEdg `  S ) `  x
)  e.  { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )
19 fnfvrnss 5842 . . . . . . 7  |-  ( ( (iEdg `  S )  Fn  dom  (iEdg `  S
)  /\  A. x  e.  dom  (iEdg `  S
) ( (iEdg `  S ) `  x
)  e.  { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )  ->  ran  (iEdg `  S
)  C_  { e  e.  ~P (Vtx `  S
)  |  e  ~~  2o } )
2012, 18, 19syl2anc 411 . . . . . 6  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  ran  (iEdg `  S )  C_  { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )
21 df-f 5361 . . . . . 6  |-  ( (iEdg `  S ) : dom  (iEdg `  S ) --> { e  e.  ~P (Vtx `  S )  |  e 
~~  2o }  <->  ( (iEdg `  S )  Fn  dom  (iEdg `  S )  /\  ran  (iEdg `  S )  C_ 
{ e  e.  ~P (Vtx `  S )  |  e  ~~  2o }
) )
2212, 20, 21sylanbrc 417 . . . . 5  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  (iEdg `  S ) : dom  (iEdg `  S ) --> { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } )
23 subgrv 16377 . . . . . . . 8  |-  ( S SubGraph  G  ->  ( S  e. 
_V  /\  G  e.  _V ) )
2423simpld 112 . . . . . . 7  |-  ( S SubGraph  G  ->  S  e.  _V )
251, 3isumgren 16226 . . . . . . 7  |-  ( S  e.  _V  ->  ( S  e. UMGraph  <->  (iEdg `  S ) : dom  (iEdg `  S
) --> { e  e. 
~P (Vtx `  S
)  |  e  ~~  2o } ) )
2624, 25syl 14 . . . . . 6  |-  ( S SubGraph  G  ->  ( S  e. UMGraph  <->  (iEdg `  S ) : dom  (iEdg `  S ) --> { e  e.  ~P (Vtx `  S )  |  e 
~~  2o } ) )
2726ad2antrl 490 . . . . 5  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  ( S  e. UMGraph  <->  (iEdg `  S ) : dom  (iEdg `  S
) --> { e  e. 
~P (Vtx `  S
)  |  e  ~~  2o } ) )
2822, 27mpbird 167 . . . 4  |-  ( ( ( (Vtx `  S
)  C_  (Vtx `  G
)  /\  (iEdg `  S
)  C_  (iEdg `  G
)  /\  (Edg `  S
)  C_  ~P (Vtx `  S ) )  /\  ( S SubGraph  G  /\  G  e. UMGraph ) )  ->  S  e. UMGraph )
2928ex 115 . . 3  |-  ( ( (Vtx `  S )  C_  (Vtx `  G )  /\  (iEdg `  S )  C_  (iEdg `  G )  /\  (Edg `  S )  C_ 
~P (Vtx `  S
) )  ->  (
( S SubGraph  G  /\  G  e. UMGraph )  ->  S  e. UMGraph ) )
306, 29syl 14 . 2  |-  ( S SubGraph  G  ->  ( ( S SubGraph  G  /\  G  e. UMGraph )  ->  S  e. UMGraph ) )
3130anabsi8 584 1  |-  ( ( G  e. UMGraph  /\  S SubGraph  G )  ->  S  e. UMGraph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    e. wcel 2205   A.wral 2522   {crab 2526   _Vcvv 2815    C_ wss 3214   ~Pcpw 3674   class class class wbr 4114   dom cdm 4754   ran crn 4755   Fun wfun 5351    Fn wfn 5352   -->wf 5353   ` cfv 5357   2oc2o 6654    ~~ cen 6986  Vtxcvtx 16133  iEdgciedg 16134  Edgcedg 16178  UHGraphcuhgr 16188  UMGraphcumgr 16213   SubGraph csubgr 16374
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-1o 6660  df-2o 6661  df-en 6989  df-sub 8462  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-dec 9728  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-edg 16179  df-uhgrm 16190  df-upgren 16214  df-umgren 16215  df-subgr 16375
This theorem is referenced by:  umgrspan  16401
  Copyright terms: Public domain W3C validator