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

Theorem 0grsubgr 16419
Description: The null graph (represented by an empty set) is a subgraph of all graphs. (Contributed by AV, 17-Nov-2020.)
Assertion
Ref Expression
0grsubgr  |-  ( G  e.  W  ->  (/) SubGraph  G )

Proof of Theorem 0grsubgr
StepHypRef Expression
1 0ss 3561 . . 3  |-  (/)  C_  (Vtx `  G )
2 dm0 4990 . . . . 5  |-  dom  (/)  =  (/)
32reseq2i 5055 . . . 4  |-  ( (iEdg `  G )  |`  dom  (/) )  =  ( (iEdg `  G
)  |`  (/) )
4 res0 5062 . . . 4  |-  ( (iEdg `  G )  |`  (/) )  =  (/)
53, 4eqtr2i 2260 . . 3  |-  (/)  =  ( (iEdg `  G )  |` 
dom  (/) )
6 0ss 3561 . . 3  |-  (/)  C_  ~P (/)
71, 5, 63pm3.2i 1206 . 2  |-  ( (/)  C_  (Vtx `  G )  /\  (/)  =  ( (iEdg `  G )  |`  dom  (/) )  /\  (/)  C_  ~P (/) )
8 0ex 4255 . . 3  |-  (/)  e.  _V
9 vtxval0 16208 . . . . 5  |-  (Vtx `  (/) )  =  (/)
109eqcomi 2242 . . . 4  |-  (/)  =  (Vtx
`  (/) )
11 eqid 2238 . . . 4  |-  (Vtx `  G )  =  (Vtx
`  G )
12 iedgval0 16209 . . . . 5  |-  (iEdg `  (/) )  =  (/)
1312eqcomi 2242 . . . 4  |-  (/)  =  (iEdg `  (/) )
14 eqid 2238 . . . 4  |-  (iEdg `  G )  =  (iEdg `  G )
15 edgval 16215 . . . . 5  |-  (Edg `  (/) )  =  ran  (iEdg `  (/) )
1612rneqi 5005 . . . . 5  |-  ran  (iEdg `  (/) )  =  ran  (/)
17 rn0 5033 . . . . 5  |-  ran  (/)  =  (/)
1815, 16, 173eqtrri 2264 . . . 4  |-  (/)  =  (Edg
`  (/) )
1910, 11, 13, 14, 18issubgr 16412 . . 3  |-  ( ( G  e.  W  /\  (/) 
e.  _V )  ->  ( (/) SubGraph  G  <-> 
( (/)  C_  (Vtx `  G
)  /\  (/)  =  ( (iEdg `  G )  |` 
dom  (/) )  /\  (/)  C_  ~P (/) ) ) )
208, 19mpan2 429 . 2  |-  ( G  e.  W  ->  ( (/) SubGraph  G  <-> 
( (/)  C_  (Vtx `  G
)  /\  (/)  =  ( (iEdg `  G )  |` 
dom  (/) )  /\  (/)  C_  ~P (/) ) ) )
217, 20mpbiri 168 1  |-  ( G  e.  W  ->  (/) SubGraph  G )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821    C_ wss 3220   (/)c0 3520   ~Pcpw 3685   class class class wbr 4125   dom cdm 4769   ran crn 4770    |` cres 4771   ` cfv 5372  Vtxcvtx 16167  iEdgciedg 16168  Edgcedg 16212   SubGraph csubgr 16408
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 623  ax-in2 624  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 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fo 5378  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-sub 8489  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-9 9349  df-n0 9543  df-dec 9757  df-ndx 13333  df-slot 13334  df-base 13336  df-edgf 16160  df-vtx 16169  df-iedg 16170  df-edg 16213  df-subgr 16409
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator