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

Theorem issubgr 27205
Description: The property of a set to be a subgraph of another set. (Contributed by AV, 16-Nov-2020.)
Hypotheses
Ref Expression
issubgr.v 𝑉 = (Vtx‘𝑆)
issubgr.a 𝐴 = (Vtx‘𝐺)
issubgr.i 𝐼 = (iEdg‘𝑆)
issubgr.b 𝐵 = (iEdg‘𝐺)
issubgr.e 𝐸 = (Edg‘𝑆)
Assertion
Ref Expression
issubgr ((𝐺𝑊𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))

Proof of Theorem issubgr
Dummy variables 𝑠 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6668 . . . . . . 7 (𝑠 = 𝑆 → (Vtx‘𝑠) = (Vtx‘𝑆))
21adantr 484 . . . . . 6 ((𝑠 = 𝑆𝑔 = 𝐺) → (Vtx‘𝑠) = (Vtx‘𝑆))
3 fveq2 6668 . . . . . . 7 (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
43adantl 485 . . . . . 6 ((𝑠 = 𝑆𝑔 = 𝐺) → (Vtx‘𝑔) = (Vtx‘𝐺))
52, 4sseq12d 3908 . . . . 5 ((𝑠 = 𝑆𝑔 = 𝐺) → ((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ↔ (Vtx‘𝑆) ⊆ (Vtx‘𝐺)))
6 fveq2 6668 . . . . . . 7 (𝑠 = 𝑆 → (iEdg‘𝑠) = (iEdg‘𝑆))
76adantr 484 . . . . . 6 ((𝑠 = 𝑆𝑔 = 𝐺) → (iEdg‘𝑠) = (iEdg‘𝑆))
8 fveq2 6668 . . . . . . . 8 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
98adantl 485 . . . . . . 7 ((𝑠 = 𝑆𝑔 = 𝐺) → (iEdg‘𝑔) = (iEdg‘𝐺))
106dmeqd 5742 . . . . . . . 8 (𝑠 = 𝑆 → dom (iEdg‘𝑠) = dom (iEdg‘𝑆))
1110adantr 484 . . . . . . 7 ((𝑠 = 𝑆𝑔 = 𝐺) → dom (iEdg‘𝑠) = dom (iEdg‘𝑆))
129, 11reseq12d 5820 . . . . . 6 ((𝑠 = 𝑆𝑔 = 𝐺) → ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)))
137, 12eqeq12d 2754 . . . . 5 ((𝑠 = 𝑆𝑔 = 𝐺) → ((iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ↔ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆))))
14 fveq2 6668 . . . . . . 7 (𝑠 = 𝑆 → (Edg‘𝑠) = (Edg‘𝑆))
151pweqd 4504 . . . . . . 7 (𝑠 = 𝑆 → 𝒫 (Vtx‘𝑠) = 𝒫 (Vtx‘𝑆))
1614, 15sseq12d 3908 . . . . . 6 (𝑠 = 𝑆 → ((Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠) ↔ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)))
1716adantr 484 . . . . 5 ((𝑠 = 𝑆𝑔 = 𝐺) → ((Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠) ↔ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)))
185, 13, 173anbi123d 1437 . . . 4 ((𝑠 = 𝑆𝑔 = 𝐺) → (((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ∧ (iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ∧ (Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠)) ↔ ((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆))))
19 df-subgr 27202 . . . 4 SubGraph = {⟨𝑠, 𝑔⟩ ∣ ((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ∧ (iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ∧ (Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠))}
2018, 19brabga 5386 . . 3 ((𝑆𝑈𝐺𝑊) → (𝑆 SubGraph 𝐺 ↔ ((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆))))
2120ancoms 462 . 2 ((𝐺𝑊𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ ((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆))))
22 issubgr.v . . . 4 𝑉 = (Vtx‘𝑆)
23 issubgr.a . . . 4 𝐴 = (Vtx‘𝐺)
2422, 23sseq12i 3905 . . 3 (𝑉𝐴 ↔ (Vtx‘𝑆) ⊆ (Vtx‘𝐺))
25 issubgr.i . . . 4 𝐼 = (iEdg‘𝑆)
26 issubgr.b . . . . 5 𝐵 = (iEdg‘𝐺)
2725dmeqi 5741 . . . . 5 dom 𝐼 = dom (iEdg‘𝑆)
2826, 27reseq12i 5817 . . . 4 (𝐵 ↾ dom 𝐼) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆))
2925, 28eqeq12i 2753 . . 3 (𝐼 = (𝐵 ↾ dom 𝐼) ↔ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)))
30 issubgr.e . . . 4 𝐸 = (Edg‘𝑆)
3122pweqi 4503 . . . 4 𝒫 𝑉 = 𝒫 (Vtx‘𝑆)
3230, 31sseq12i 3905 . . 3 (𝐸 ⊆ 𝒫 𝑉 ↔ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆))
3324, 29, 323anbi123i 1156 . 2 ((𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉) ↔ ((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) = ((iEdg‘𝐺) ↾ dom (iEdg‘𝑆)) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)))
3421, 33bitr4di 292 1 ((𝐺𝑊𝑆𝑈) → (𝑆 SubGraph 𝐺 ↔ (𝑉𝐴𝐼 = (𝐵 ↾ dom 𝐼) ∧ 𝐸 ⊆ 𝒫 𝑉)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1088   = wceq 1542  wcel 2113  wss 3841  𝒫 cpw 4485   class class class wbr 5027  dom cdm 5519  cres 5521  cfv 6333  Vtxcvtx 26933  iEdgciedg 26934  Edgcedg 26984   SubGraph csubgr 27201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-ext 2710  ax-sep 5164  ax-nul 5171  ax-pr 5293
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-sb 2074  df-clab 2717  df-cleq 2730  df-clel 2811  df-rab 3062  df-v 3399  df-dif 3844  df-un 3846  df-in 3848  df-ss 3858  df-nul 4210  df-if 4412  df-pw 4487  df-sn 4514  df-pr 4516  df-op 4520  df-uni 4794  df-br 5028  df-opab 5090  df-xp 5525  df-dm 5529  df-res 5531  df-iota 6291  df-fv 6341  df-subgr 27202
This theorem is referenced by:  issubgr2  27206  subgrprop  27207  uhgrissubgr  27209  egrsubgr  27211  0grsubgr  27212  uhgrspan1  27237
  Copyright terms: Public domain W3C validator