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

Theorem uhgrissubgr 16502
Description: The property of a hypergraph to be a subgraph. (Contributed by AV, 19-Nov-2020.)
Hypotheses
Ref Expression
uhgrissubgr.v  |-  V  =  (Vtx `  S )
uhgrissubgr.a  |-  A  =  (Vtx `  G )
uhgrissubgr.i  |-  I  =  (iEdg `  S )
uhgrissubgr.b  |-  B  =  (iEdg `  G )
Assertion
Ref Expression
uhgrissubgr  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  ( S SubGraph  G  <->  ( V  C_  A  /\  I  C_  B ) ) )

Proof of Theorem uhgrissubgr
Dummy variable  e is distinct from all other variables.
StepHypRef Expression
1 uhgrissubgr.v . . . 4  |-  V  =  (Vtx `  S )
2 uhgrissubgr.a . . . 4  |-  A  =  (Vtx `  G )
3 uhgrissubgr.i . . . 4  |-  I  =  (iEdg `  S )
4 uhgrissubgr.b . . . 4  |-  B  =  (iEdg `  G )
5 eqid 2238 . . . 4  |-  (Edg `  S )  =  (Edg
`  S )
61, 2, 3, 4, 5subgrprop2 16501 . . 3  |-  ( S SubGraph  G  ->  ( V  C_  A  /\  I  C_  B  /\  (Edg `  S )  C_ 
~P V ) )
7 3simpa 1025 . . 3  |-  ( ( V  C_  A  /\  I  C_  B  /\  (Edg `  S )  C_  ~P V )  ->  ( V  C_  A  /\  I  C_  B ) )
86, 7syl 14 . 2  |-  ( S SubGraph  G  ->  ( V  C_  A  /\  I  C_  B
) )
9 simprl 535 . . . 4  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  ->  V  C_  A )
10 simp2 1029 . . . . . 6  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  Fun  B )
11 simpr 110 . . . . . 6  |-  ( ( V  C_  A  /\  I  C_  B )  ->  I  C_  B )
12 funssres 5420 . . . . . 6  |-  ( ( Fun  B  /\  I  C_  B )  ->  ( B  |`  dom  I )  =  I )
1310, 11, 12syl2an 289 . . . . 5  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  -> 
( B  |`  dom  I
)  =  I )
1413eqcomd 2244 . . . 4  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  ->  I  =  ( B  |` 
dom  I ) )
15 edguhgr 16378 . . . . . . . . 9  |-  ( ( S  e. UHGraph  /\  e  e.  (Edg `  S )
)  ->  e  e.  ~P (Vtx `  S )
)
1615ex 115 . . . . . . . 8  |-  ( S  e. UHGraph  ->  ( e  e.  (Edg `  S )  ->  e  e.  ~P (Vtx `  S ) ) )
171pweqi 3692 . . . . . . . . 9  |-  ~P V  =  ~P (Vtx `  S
)
1817eleq2i 2305 . . . . . . . 8  |-  ( e  e.  ~P V  <->  e  e.  ~P (Vtx `  S )
)
1916, 18imbitrrdi 162 . . . . . . 7  |-  ( S  e. UHGraph  ->  ( e  e.  (Edg `  S )  ->  e  e.  ~P V
) )
2019ssrdv 3254 . . . . . 6  |-  ( S  e. UHGraph  ->  (Edg `  S
)  C_  ~P V
)
21203ad2ant3 1051 . . . . 5  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  (Edg `  S
)  C_  ~P V
)
2221adantr 276 . . . 4  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  -> 
(Edg `  S )  C_ 
~P V )
231, 2, 3, 4, 5issubgr 16498 . . . . . 6  |-  ( ( G  e.  W  /\  S  e. UHGraph )  ->  ( S SubGraph  G  <->  ( V  C_  A  /\  I  =  ( B  |`  dom  I )  /\  (Edg `  S
)  C_  ~P V
) ) )
24233adant2 1047 . . . . 5  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  ( S SubGraph  G  <->  ( V  C_  A  /\  I  =  ( B  |`  dom  I
)  /\  (Edg `  S
)  C_  ~P V
) ) )
2524adantr 276 . . . 4  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  -> 
( S SubGraph  G  <->  ( V  C_  A  /\  I  =  ( B  |`  dom  I
)  /\  (Edg `  S
)  C_  ~P V
) ) )
269, 14, 22, 25mpbir3and 1211 . . 3  |-  ( ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  /\  ( V 
C_  A  /\  I  C_  B ) )  ->  S SubGraph  G )
2726ex 115 . 2  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  ( ( V 
C_  A  /\  I  C_  B )  ->  S SubGraph  G ) )
288, 27impbid2 143 1  |-  ( ( G  e.  W  /\  Fun  B  /\  S  e. UHGraph )  ->  ( S SubGraph  G  <->  ( V  C_  A  /\  I  C_  B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ~Pcpw 3688   class class class wbr 4130   dom cdm 4774    |` cres 4776   Fun wfun 5371   ` cfv 5377  Vtxcvtx 16253  iEdgciedg 16254  Edgcedg 16298  UHGraphcuhgr 16308   SubGraph csubgr 16494
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof 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-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-sub 8499  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778  df-ndx 13355  df-slot 13356  df-base 13358  df-edgf 16246  df-vtx 16255  df-iedg 16256  df-edg 16299  df-uhgrm 16310  df-subgr 16495
This theorem is used by:  uhgrsubgrself  16507
  Copyright terms: Public domain W3C validator