| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrres | Structured version Visualization version GIF version | ||
| Description: A subgraph obtained by removing one vertex and all edges incident with this vertex from a pseudograph (see uhgrspan1 29941) is a pseudograph. (Contributed by AV, 8-Nov-2020.) (Revised by AV, 19-Dec-2021.) |
| Ref | Expression |
|---|---|
| upgrres.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| upgrres.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| upgrres.f | ⊢ 𝐹 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} |
| upgrres.s | ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), (𝐸 ↾ 𝐹)〉 |
| Ref | Expression |
|---|---|
| upgrres | ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ UPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgruhgr 29737 | . . . . . 6 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
| 2 | upgrres.e | . . . . . . 7 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 2 | uhgrfun 29701 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
| 4 | funres 6610 | . . . . . 6 ⊢ (Fun 𝐸 → Fun (𝐸 ↾ 𝐹)) | |
| 5 | 1, 3, 4 | 3syl 19 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → Fun (𝐸 ↾ 𝐹)) |
| 6 | 5 | funfnd 6599 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐸 ↾ 𝐹) Fn dom (𝐸 ↾ 𝐹)) |
| 7 | 6 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝐸 ↾ 𝐹) Fn dom (𝐸 ↾ 𝐹)) |
| 8 | upgrres.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 9 | upgrres.f | . . . 4 ⊢ 𝐹 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} | |
| 10 | 8, 2, 9 | upgrreslem 29942 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ran (𝐸 ↾ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}) |
| 11 | df-f 6570 | . . 3 ⊢ ((𝐸 ↾ 𝐹):dom (𝐸 ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ((𝐸 ↾ 𝐹) Fn dom (𝐸 ↾ 𝐹) ∧ ran (𝐸 ↾ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})) | |
| 12 | 7, 10, 11 | sylanbrc 595 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝐸 ↾ 𝐹):dom (𝐸 ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}) |
| 13 | upgrres.s | . . . 4 ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), (𝐸 ↾ 𝐹)〉 | |
| 14 | opex 5439 | . . . 4 ⊢ 〈(𝑉 ∖ {𝑁}), (𝐸 ↾ 𝐹)〉 ∈ V | |
| 15 | 13, 14 | eqeltri 2860 | . . 3 ⊢ 𝑆 ∈ V |
| 16 | 8, 2, 9, 13 | uhgrspan1lem2 29939 | . . . . 5 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁}) |
| 17 | 16 | eqcomi 2772 | . . . 4 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
| 18 | 8, 2, 9, 13 | uhgrspan1lem3 29940 | . . . . 5 ⊢ (iEdg‘𝑆) = (𝐸 ↾ 𝐹) |
| 19 | 18 | eqcomi 2772 | . . . 4 ⊢ (𝐸 ↾ 𝐹) = (iEdg‘𝑆) |
| 20 | 17, 19 | isupgr 29719 | . . 3 ⊢ (𝑆 ∈ V → (𝑆 ∈ UPGraph ↔ (𝐸 ↾ 𝐹):dom (𝐸 ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})) |
| 21 | 15, 20 | mp1i 14 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ UPGraph ↔ (𝐸 ↾ 𝐹):dom (𝐸 ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})) |
| 22 | 12, 21 | mpbird 260 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∉ wnel 3065 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∅c0 4281 𝒫 cpw 4560 {csn 4588 〈cop 4840 class class class wbr 5108 dom cdm 5658 ran crn 5659 ↾ cres 5660 Fun wfun 6560 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 ≤ cle 11383 2c2 12437 ♯chash 14515 Vtxcvtx 29631 iEdgciedg 29632 UHGraphcuhgr 29691 UPGraphcupgr 29715 |
| 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 ax-un 7783 |
| 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-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 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-mpt 5193 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-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-1st 8035 df-2nd 8036 df-vtx 29633 df-iedg 29634 df-uhgr 29693 df-upgr 29717 |
| This theorem is used by: finsumvtxdg2size 30188 |
| Copyright terms: Public domain | W3C validator |