MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  issubgr2 Structured version   Visualization version   GIF version

Theorem issubgr2 29358
Description: The property of a set to be a subgraph of a set whose edge function is actually a function. (Contributed by AV, 20-Nov-2020.)
Hypotheses
Ref Expression
issubgr.v 𝑉 = (Vtx‘𝑆)
issubgr.a 𝐴 = (Vtx‘𝐺)
issubgr.i 𝐼 = (iEdg‘𝑆)
issubgr.b 𝐵 = (iEdg‘𝐺)
issubgr.e 𝐸 = (Edg‘𝑆)
Assertion
Ref Expression
issubgr2 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉)))

Proof of Theorem issubgr2
StepHypRef Expression
1 issubgr.v . . . 4 𝑉 = (Vtx‘𝑆)
2 issubgr.a . . . 4 𝐴 = (Vtx‘𝐺)
3 issubgr.i . . . 4 𝐼 = (iEdg‘𝑆)
4 issubgr.b . . . 4 𝐵 = (iEdg‘𝐺)
5 issubgr.e . . . 4 𝐸 = (Edg‘𝑆)
61, 2, 3, 4, 5issubgr 29357 . . 3 ((𝐺𝑊𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
763adant2 1132 . 2 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
8 resss 5961 . . . . 5 (𝐵 ↾ dom 𝐼) ⊆ 𝐵
9 sseq1 3948 . . . . 5 (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵))
108, 9mpbiri 258 . . . 4 (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼𝐵)
11 funssres 6537 . . . . . . 7 ((Fun 𝐵𝐼𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼)
1211eqcomd 2743 . . . . . 6 ((Fun 𝐵𝐼𝐵) → 𝐼 = (𝐵 ↾ dom 𝐼))
1312ex 412 . . . . 5 (Fun 𝐵 → (𝐼𝐵𝐼 = (𝐵 ↾ dom 𝐼)))
14133ad2ant2 1135 . . . 4 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝐼𝐵𝐼 = (𝐵 ↾ dom 𝐼)))
1510, 14impbid2 226 . . 3 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝐼 = (𝐵 ↾ dom 𝐼) ↔ 𝐼𝐵))
16153anbi2d 1444 . 2 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → ((𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉)))
177, 16bitrd 279 1 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wss 3890  𝒫 cpw 4542   class class class wbr 5086  dom cdm 5625  cres 5627  Fun wfun 6487  cfv 6493  Vtxcvtx 29082  iEdgciedg 29083  Edgcedg 29133   SubGraph csubgr 29353
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-res 5637  df-iota 6449  df-fun 6495  df-fv 6501  df-subgr 29354
This theorem is referenced by:  uhgrspansubgr  29377
  Copyright terms: Public domain W3C validator