| 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 3954 | . . 3 ⊢ (𝐺 ∈ UHGraph → 𝑉 ⊆ 𝑉) | |
| 2 | isubgriedg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | isubgriedg.e | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | isisubgr 47986 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑉 ⊆ 𝑉) → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 5 | 1, 4 | mpdan 687 | . 2 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉) |
| 6 | 3 | uhgrfun 29046 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
| 7 | funrel 6503 | . . . . 5 ⊢ (Fun 𝐸 → Rel 𝐸) | |
| 8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UHGraph → Rel 𝐸) |
| 9 | 2, 3 | uhgrf 29042 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})) |
| 10 | ffvelcdm 7020 | . . . . . . . 8 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅})) | |
| 11 | eldifi 4080 | . . . . . . . . 9 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ∈ 𝒫 𝑉) | |
| 12 | 11 | elpwid 4558 | . . . . . . . 8 ⊢ ((𝐸‘𝑥) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑥) ⊆ 𝑉) |
| 13 | 10, 12 | syl 17 | . . . . . . 7 ⊢ ((𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ∧ 𝑥 ∈ dom 𝐸) → (𝐸‘𝑥) ⊆ 𝑉) |
| 14 | 13 | rabeqcda 3407 | . . . . . 6 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉} = dom 𝐸) |
| 15 | 14 | eqimsscd 3988 | . . . . 5 ⊢ (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 16 | 9, 15 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UHGraph → dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) |
| 17 | relssres 5975 | . . . 4 ⊢ ((Rel 𝐸 ∧ dom 𝐸 ⊆ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) | |
| 18 | 8, 16, 17 | syl2anc 584 | . . 3 ⊢ (𝐺 ∈ UHGraph → (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉}) = 𝐸) |
| 19 | 18 | opeq2d 4831 | . 2 ⊢ (𝐺 ∈ UHGraph → 〈𝑉, (𝐸 ↾ {𝑥 ∈ dom 𝐸 ∣ (𝐸‘𝑥) ⊆ 𝑉})〉 = 〈𝑉, 𝐸〉) |
| 20 | 5, 19 | eqtrd 2768 | 1 ⊢ (𝐺 ∈ UHGraph → (𝐺 ISubGr 𝑉) = 〈𝑉, 𝐸〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3396 ∖ cdif 3895 ⊆ wss 3898 ∅c0 4282 𝒫 cpw 4549 {csn 4575 〈cop 4581 dom cdm 5619 ↾ cres 5621 Rel wrel 5624 Fun wfun 6480 ⟶wf 6482 ‘cfv 6486 (class class class)co 7352 Vtxcvtx 28976 iEdgciedg 28977 UHGraphcuhgr 29036 ISubGr cisubgr 47984 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-fv 6494 df-ov 7355 df-oprab 7356 df-mpo 7357 df-uhgr 29038 df-isubgr 47985 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |