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

Theorem 0uhgrsubgr 16135
Description: The null graph (as hypergraph) is a subgraph of all graphs. (Contributed by AV, 17-Nov-2020.) (Proof shortened by AV, 28-Nov-2020.)
Assertion
Ref Expression
0uhgrsubgr  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  S SubGraph  G )

Proof of Theorem 0uhgrsubgr
StepHypRef Expression
1 3simpa 1020 . 2  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  ( G  e.  W  /\  S  e. UHGraph ) )
2 0ss 3533 . . . 4  |-  (/)  C_  (Vtx `  G )
3 sseq1 3250 . . . 4  |-  ( (Vtx
`  S )  =  (/)  ->  ( (Vtx `  S )  C_  (Vtx `  G )  <->  (/)  C_  (Vtx `  G ) ) )
42, 3mpbiri 168 . . 3  |-  ( (Vtx
`  S )  =  (/)  ->  (Vtx `  S
)  C_  (Vtx `  G
) )
543ad2ant3 1046 . 2  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  (Vtx `  S
)  C_  (Vtx `  G
) )
6 eqid 2231 . . . 4  |-  (iEdg `  S )  =  (iEdg `  S )
76uhgrfun 15947 . . 3  |-  ( S  e. UHGraph  ->  Fun  (iEdg `  S
) )
873ad2ant2 1045 . 2  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  Fun  (iEdg `  S
) )
9 edgval 15930 . . 3  |-  (Edg `  S )  =  ran  (iEdg `  S )
10 uhgr0vb 15954 . . . . . . . 8  |-  ( ( S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  ( S  e. UHGraph  <->  (iEdg `  S )  =  (/) ) )
11 rneq 4959 . . . . . . . . 9  |-  ( (iEdg `  S )  =  (/)  ->  ran  (iEdg `  S
)  =  ran  (/) )
12 rn0 4988 . . . . . . . . 9  |-  ran  (/)  =  (/)
1311, 12eqtrdi 2280 . . . . . . . 8  |-  ( (iEdg `  S )  =  (/)  ->  ran  (iEdg `  S
)  =  (/) )
1410, 13biimtrdi 163 . . . . . . 7  |-  ( ( S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  ( S  e. UHGraph  ->  ran  (iEdg `  S
)  =  (/) ) )
1514ex 115 . . . . . 6  |-  ( S  e. UHGraph  ->  ( (Vtx `  S )  =  (/)  ->  ( S  e. UHGraph  ->  ran  (iEdg `  S )  =  (/) ) ) )
1615pm2.43a 51 . . . . 5  |-  ( S  e. UHGraph  ->  ( (Vtx `  S )  =  (/)  ->  ran  (iEdg `  S
)  =  (/) ) )
1716a1i 9 . . . 4  |-  ( G  e.  W  ->  ( S  e. UHGraph  ->  ( (Vtx
`  S )  =  (/)  ->  ran  (iEdg `  S
)  =  (/) ) ) )
18173imp 1219 . . 3  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  ran  (iEdg `  S
)  =  (/) )
199, 18eqtrid 2276 . 2  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  (Edg `  S
)  =  (/) )
20 egrsubgr 16133 . 2  |-  ( ( ( G  e.  W  /\  S  e. UHGraph )  /\  (Vtx `  S )  C_  (Vtx `  G )  /\  ( Fun  (iEdg `  S
)  /\  (Edg `  S
)  =  (/) ) )  ->  S SubGraph  G )
211, 5, 8, 19, 20syl112anc 1277 1  |-  ( ( G  e.  W  /\  S  e. UHGraph  /\  (Vtx `  S )  =  (/) )  ->  S SubGraph  G )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397    e. wcel 2202    C_ wss 3200   (/)c0 3494   class class class wbr 4088   ran crn 4726   Fun wfun 5320   ` cfv 5326  Vtxcvtx 15882  iEdgciedg 15883  Edgcedg 15927  UHGraphcuhgr 15937   SubGraph csubgr 16123
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-sub 8352  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-9 9209  df-n0 9403  df-dec 9612  df-ndx 13103  df-slot 13104  df-base 13106  df-edgf 15875  df-vtx 15884  df-iedg 15885  df-edg 15928  df-uhgrm 15939  df-subgr 16124
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator