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

Theorem uhgr0v0e 16111
Description: The null graph, with no vertices, has no edges. (Contributed by AV, 21-Oct-2020.)
Hypotheses
Ref Expression
uhgr0v0e.v  |-  V  =  (Vtx `  G )
uhgr0v0e.e  |-  E  =  (Edg `  G )
Assertion
Ref Expression
uhgr0v0e  |-  ( ( G  e. UHGraph  /\  V  =  (/) )  ->  E  =  (/) )

Proof of Theorem uhgr0v0e
StepHypRef Expression
1 uhgr0v0e.v . . . . . 6  |-  V  =  (Vtx `  G )
21eqeq1i 2238 . . . . 5  |-  ( V  =  (/)  <->  (Vtx `  G )  =  (/) )
3 uhgr0vb 15961 . . . . . . 7  |-  ( ( G  e. UHGraph  /\  (Vtx `  G )  =  (/) )  ->  ( G  e. UHGraph  <->  (iEdg `  G )  =  (/) ) )
43biimpd 144 . . . . . 6  |-  ( ( G  e. UHGraph  /\  (Vtx `  G )  =  (/) )  ->  ( G  e. UHGraph  ->  (iEdg `  G )  =  (/) ) )
54ex 115 . . . . 5  |-  ( G  e. UHGraph  ->  ( (Vtx `  G )  =  (/)  ->  ( G  e. UHGraph  ->  (iEdg `  G )  =  (/) ) ) )
62, 5biimtrid 152 . . . 4  |-  ( G  e. UHGraph  ->  ( V  =  (/)  ->  ( G  e. UHGraph  ->  (iEdg `  G )  =  (/) ) ) )
76pm2.43a 51 . . 3  |-  ( G  e. UHGraph  ->  ( V  =  (/)  ->  (iEdg `  G
)  =  (/) ) )
87imp 124 . 2  |-  ( ( G  e. UHGraph  /\  V  =  (/) )  ->  (iEdg `  G )  =  (/) )
9 uhgr0v0e.e . . . . 5  |-  E  =  (Edg `  G )
109eqeq1i 2238 . . . 4  |-  ( E  =  (/)  <->  (Edg `  G )  =  (/) )
11 uhgriedg0edg0 16012 . . . 4  |-  ( G  e. UHGraph  ->  ( (Edg `  G )  =  (/)  <->  (iEdg `  G )  =  (/) ) )
1210, 11bitrid 192 . . 3  |-  ( G  e. UHGraph  ->  ( E  =  (/) 
<->  (iEdg `  G )  =  (/) ) )
1312adantr 276 . 2  |-  ( ( G  e. UHGraph  /\  V  =  (/) )  ->  ( E  =  (/)  <->  (iEdg `  G )  =  (/) ) )
148, 13mpbird 167 1  |-  ( ( G  e. UHGraph  /\  V  =  (/) )  ->  E  =  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2201   (/)c0 3493   ` cfv 5325  Vtxcvtx 15889  iEdgciedg 15890  Edgcedg 15934  UHGraphcuhgr 15944
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 2203  ax-14 2204  ax-ext 2212  ax-sep 4206  ax-nul 4214  ax-pow 4263  ax-pr 4298  ax-un 4529  ax-setind 4634  ax-cnex 8125  ax-resscn 8126  ax-1cn 8127  ax-1re 8128  ax-icn 8129  ax-addcl 8130  ax-addrcl 8131  ax-mulcl 8132  ax-addcom 8134  ax-mulcom 8135  ax-addass 8136  ax-mulass 8137  ax-distr 8138  ax-i2m1 8139  ax-1rid 8141  ax-0id 8142  ax-rnegex 8143  ax-cnre 8145
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-if 3605  df-pw 3653  df-sn 3674  df-pr 3675  df-op 3677  df-uni 3893  df-int 3928  df-br 4088  df-opab 4150  df-mpt 4151  df-id 4389  df-xp 4730  df-rel 4731  df-cnv 4732  df-co 4733  df-dm 4734  df-rn 4735  df-res 4736  df-iota 5285  df-fun 5327  df-fn 5328  df-f 5329  df-fo 5331  df-fv 5333  df-riota 5973  df-ov 6023  df-oprab 6024  df-mpo 6025  df-1st 6305  df-2nd 6306  df-sub 8354  df-inn 9146  df-2 9204  df-3 9205  df-4 9206  df-5 9207  df-6 9208  df-7 9209  df-8 9210  df-9 9211  df-n0 9405  df-dec 9614  df-ndx 13105  df-slot 13106  df-base 13108  df-edgf 15882  df-vtx 15891  df-iedg 15892  df-edg 15935  df-uhgrm 15946
This theorem is referenced by:  uhgr0vsize0en  16112  uhgr0vusgr  16115
  Copyright terms: Public domain W3C validator