| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isubgrvtxuhgr | Structured version Visualization version GIF version | ||
| Description: The subgraph induced by the full set of vertices of a hypergraph. (Contributed by AV, 12-May-2025.) |
| Ref | Expression |
|---|---|
| isubgriedg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| isubgriedg.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| isubgrvtxuhgr | ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, 𝐸〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssidd 3931 | . . 3 ⊢ (𝐺 ∈ UHGraph → 𝑉 ⊆ 𝑉) | |
| 2 | isubgriedg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | isubgriedg.e | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | isisubgr 49054 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑉 ⊆ 𝑉) → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 5 | 1, 4 | mpdan 700 | . 2 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 6 | 3 | uhgrfun 29650 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
| 7 | funrel 6557 | . . . . 5 ⊢ (Fun 𝐸 → Rel 𝐸) | |
| 8 | 6, 7 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UHGraph → Rel 𝐸) |
| 9 | 2, 3 | uhgrf 29646 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})) |
| 10 | ffvelcdm 7082 | . . . . . . . 8 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅})) | |
| 11 | eldifi 4067 | . . . . . . . . 9 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ∈ 𝒫 𝑉) | |
| 12 | 11 | elpwid 4565 | . . . . . . . 8 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ⊆ 𝑉) |
| 13 | 10, 12 | syl 18 | . . . . . . 7 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ⊆ 𝑉) |
| 14 | 13 | rabeqcda 3423 | . . . . . 6 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉} = dom 𝐸) |
| 15 | 14 | eqimsscd 3965 | . . . . 5 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 16 | 9, 15 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UHGraph → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 17 | relssres 6010 | . . . 4 ⊢ ((Rel 𝐸 ∧ dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) | |
| 18 | 8, 16, 17 | syl2anc 596 | . . 3 ⊢ (𝐺 ∈ UHGraph → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) |
| 19 | 18 | opeq2d 4846 | . 2 ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉 = 〈𝑉, 𝐸〉) |
| 20 | 5, 19 | eqtrd 2795 | 1 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, 𝐸〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 {crab 3412 ⊆ wss 3895 ∖ cdif 4045 ∅c0 4278 𝒫 cpw 4556 {csn 4584 〈cop 4834 dom cdm 5650 ↾ cres 5652 Rel wrel 5655 Fun wfun 6533 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 Vtxcvtx 29580 iEdgciedg 29581 UHGraphcuhgr 29640 ISubGr cisubgr 49052 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-uhgr 29642 df-isubgr 49053 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |