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

Theorem issubgr2 29563
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 29562 . . 3 ((𝐺𝑊𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
763adant2 1147 . 2 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
8 resss 6001 . . . . 5 (𝐵 ↾ dom 𝐼) ⊆ 𝐵
9 sseq1 3970 . . . . 5 (𝐼 = (𝐵 ↾ dom 𝐼) → (𝐼𝐵 ↔ (𝐵 ↾ dom 𝐼) ⊆ 𝐵))
108, 9mpbiri 261 . . . 4 (𝐼 = (𝐵 ↾ dom 𝐼) → 𝐼𝐵)
11 funssres 6581 . . . . . . 7 ((Fun 𝐵𝐼𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼)
1211eqcomd 2775 . . . . . 6 ((Fun 𝐵𝐼𝐵) → 𝐼 = (𝐵 ↾ dom 𝐼))
1312ex 417 . . . . 5 (Fun 𝐵 → (𝐼𝐵𝐼 = (𝐵 ↾ dom 𝐼)))
14133ad2ant2 1150 . . . 4 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝐼𝐵𝐼 = (𝐵 ↾ dom 𝐼)))
1510, 14impbid2 229 . . 3 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝐼 = (𝐵 ↾ dom 𝐼) ↔ 𝐼𝐵))
16153anbi2d 1467 . 2 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → ((𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉)))
177, 16bitrd 282 1 ((𝐺𝑊 ∧ Fun 𝐵𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼𝐵𝐸 ⊆ 𝒫 𝑉)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wss 3913  𝒫 cpw 4567   class class class wbr 5113  dom cdm 5662  cres 5664  Fun wfun 6531  cfv 6537  Vtxcvtx 29287  iEdgciedg 29288  Edgcedg 29338   SubGraph csubgr 29558
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-res 5674  df-iota 6493  df-fun 6539  df-fv 6545  df-subgr 29559
This theorem is referenced by:  uhgrspansubgr  29582
  Copyright terms: Public domain W3C validator