| 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 3968 | . . 3 ⊢ (𝐺 ∈ UHGraph → 𝑉 ⊆ 𝑉) | |
| 2 | isubgriedg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | isubgriedg.e | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | isisubgr 48509 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑉 ⊆ 𝑉) → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 5 | 1, 4 | mpdan 699 | . 2 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 6 | 3 | uhgrfun 29353 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
| 7 | funrel 6550 | . . . . 5 ⊢ (Fun 𝐸 → Rel 𝐸) | |
| 8 | 6, 7 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UHGraph → Rel 𝐸) |
| 9 | 2, 3 | uhgrf 29349 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})) |
| 10 | ffvelcdm 7074 | . . . . . . . 8 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅})) | |
| 11 | eldifi 4093 | . . . . . . . . 9 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ∈ 𝒫 𝑉) | |
| 12 | 11 | elpwid 4573 | . . . . . . . 8 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ⊆ 𝑉) |
| 13 | 10, 12 | syl 18 | . . . . . . 7 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ⊆ 𝑉) |
| 14 | 13 | rabeqcda 3434 | . . . . . 6 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉} = dom 𝐸) |
| 15 | 14 | eqimsscd 4002 | . . . . 5 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 16 | 9, 15 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UHGraph → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 17 | relssres 6019 | . . . 4 ⊢ ((Rel 𝐸 ∧ dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) | |
| 18 | 8, 16, 17 | syl2anc 595 | . . 3 ⊢ (𝐺 ∈ UHGraph → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) |
| 19 | 18 | opeq2d 4846 | . 2 ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉 = 〈𝑉, 𝐸〉) |
| 20 | 5, 19 | eqtrd 2804 | 1 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, 𝐸〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {crab 3423 ∖ cdif 3910 ⊆ wss 3913 ∅c0 4294 𝒫 cpw 4564 {csn 4591 〈cop 4597 dom cdm 5659 ↾ cres 5661 Rel wrel 5664 Fun wfun 6527 ⟶wf 6529 ‘cfv 6533 (class class class)co 7408 Vtxcvtx 29283 iEdgciedg 29284 UHGraphcuhgr 29343 ISubGr cisubgr 48507 |
| 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-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pr 5402 |
| 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-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-ov 7411 df-oprab 7412 df-mpo 7413 df-uhgr 29345 df-isubgr 48508 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |