Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isubgrvtxuhgr Structured version   Visualization version   GIF version

Theorem isubgrvtxuhgr 49235
Description: The subgraph induced by the full set of vertices of a hypergraph. (Contributed by AV, 12-May-2025.)
Hypotheses
Ref Expression
isubgriedg.v 𝑉 = (Vtx‘𝐺)
isubgriedg.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
isubgrvtxuhgr (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = ⟨𝑉, 𝐸⟩)

Proof of Theorem isubgrvtxuhgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssidd 3936 . . 3 (𝐺 ∈ UHGraph → 𝑉 ⊆ 𝑉)
2 isubgriedg.v . . . 4 𝑉 = (Vtx‘𝐺)
3 isubgriedg.e . . . 4 𝐸 = (iEdg‘𝐺)
42, 3isisubgr 49233 . . 3 ((𝐺 ∈ UHGraph ∧ 𝑉 ⊆ 𝑉) → (𝐺 ISubGr 𝑉) = ⟨𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})⟩)
51, 4mpdan 700 . 2 (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = ⟨𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})⟩)
63uhgrfun 29701 . . . . 5 (𝐺 ∈ UHGraph → Fun 𝐸)
7 funrel 6584 . . . . 5 (Fun 𝐸 → Rel 𝐸)
86, 7syl 18 . . . 4 (𝐺 ∈ UHGraph → Rel 𝐸)
92, 3uhgrf 29697 . . . . 5 (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))
10 ffvelcdm 7113 . . . . . . . 8 ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}))
11 eldifi 4070 . . . . . . . . 9 ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ∈ 𝒫 𝑉)
1211elpwid 4569 . . . . . . . 8 ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ⊆ 𝑉)
1310, 12syl 18 . . . . . . 7 ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ⊆ 𝑉)
1413rabeqcda 3427 . . . . . 6 (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉} = dom 𝐸)
1514eqimsscd 3970 . . . . 5 (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})
169, 15syl 18 . . . 4 (𝐺 ∈ UHGraph → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})
17 relssres 6029 . . . 4 ((Rel 𝐸 ∧ dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸)
188, 16, 17syl2anc 596 . . 3 (𝐺 ∈ UHGraph → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸)
1918opeq2d 4852 . 2 (𝐺 ∈ UHGraph → ⟨𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})⟩ = ⟨𝑉, 𝐸⟩)
205, 19eqtrd 2798 1 (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = ⟨𝑉, 𝐸⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ⟨cop 4840  dom cdm 5658   ↾ cres 5660  Rel wrel 5663  Fun wfun 6560  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  iEdgciedg 29632  UHGraphcuhgr 29691   ISubGr cisubgr 49231
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-uhgr 29693  df-isubgr 49232
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator