![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > usgrres1 | Structured version Visualization version GIF version |
Description: Restricting a simple graph by removing one vertex results in a simple graph. Remark: This restricted graph is not a subgraph of the original graph in the sense of df-subgr 29300 since the domains of the edge functions may not be compatible. (Contributed by Alexander van der Vekens, 2-Jan-2018.) (Revised by AV, 10-Jan-2020.) (Revised by AV, 23-Oct-2020.) (Proof shortened by AV, 27-Nov-2020.) |
Ref | Expression |
---|---|
upgrres1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
upgrres1.e | ⊢ 𝐸 = (Edg‘𝐺) |
upgrres1.f | ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} |
upgrres1.s | ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 |
Ref | Expression |
---|---|
usgrres1 | ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1oi 6887 | . . . . 5 ⊢ ( I ↾ 𝐹):𝐹–1-1-onto→𝐹 | |
2 | f1of1 6848 | . . . . 5 ⊢ (( I ↾ 𝐹):𝐹–1-1-onto→𝐹 → ( I ↾ 𝐹):𝐹–1-1→𝐹) | |
3 | 1, 2 | mp1i 13 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):𝐹–1-1→𝐹) |
4 | eqidd 2736 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹) = ( I ↾ 𝐹)) | |
5 | dmresi 6072 | . . . . . 6 ⊢ dom ( I ↾ 𝐹) = 𝐹 | |
6 | 5 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → dom ( I ↾ 𝐹) = 𝐹) |
7 | eqidd 2736 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 = 𝐹) | |
8 | 4, 6, 7 | f1eq123d 6841 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → (( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→𝐹 ↔ ( I ↾ 𝐹):𝐹–1-1→𝐹)) |
9 | 3, 8 | mpbird 257 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→𝐹) |
10 | usgrumgr 29213 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph) | |
11 | upgrres1.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
12 | upgrres1.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
13 | upgrres1.f | . . . . 5 ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} | |
14 | 11, 12, 13 | umgrres1lem 29342 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ 𝑁 ∈ 𝑉) → ran ( I ↾ 𝐹) ⊆ {𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2}) |
15 | 10, 14 | sylan 580 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ran ( I ↾ 𝐹) ⊆ {𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2}) |
16 | f1ssr 6811 | . . 3 ⊢ ((( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→𝐹 ∧ ran ( I ↾ 𝐹) ⊆ {𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2}) → ( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→{𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2}) | |
17 | 9, 15, 16 | syl2anc 584 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→{𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2}) |
18 | upgrres1.s | . . . 4 ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 | |
19 | opex 5475 | . . . 4 ⊢ 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 ∈ V | |
20 | 18, 19 | eqeltri 2835 | . . 3 ⊢ 𝑆 ∈ V |
21 | 11, 12, 13, 18 | upgrres1lem2 29343 | . . . . 5 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁}) |
22 | 21 | eqcomi 2744 | . . . 4 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
23 | 11, 12, 13, 18 | upgrres1lem3 29344 | . . . . 5 ⊢ (iEdg‘𝑆) = ( I ↾ 𝐹) |
24 | 23 | eqcomi 2744 | . . . 4 ⊢ ( I ↾ 𝐹) = (iEdg‘𝑆) |
25 | 22, 24 | isusgrs 29188 | . . 3 ⊢ (𝑆 ∈ V → (𝑆 ∈ USGraph ↔ ( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→{𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2})) |
26 | 20, 25 | mp1i 13 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ USGraph ↔ ( I ↾ 𝐹):dom ( I ↾ 𝐹)–1-1→{𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (♯‘𝑝) = 2})) |
27 | 17, 26 | mpbird 257 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∉ wnel 3044 {crab 3433 Vcvv 3478 ∖ cdif 3960 ⊆ wss 3963 𝒫 cpw 4605 {csn 4631 〈cop 4637 I cid 5582 dom cdm 5689 ran crn 5690 ↾ cres 5691 –1-1→wf1 6560 –1-1-onto→wf1o 6562 ‘cfv 6563 2c2 12319 ♯chash 14366 Vtxcvtx 29028 iEdgciedg 29029 Edgcedg 29079 UMGraphcumgr 29113 USGraphcusgr 29181 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-hash 14367 df-vtx 29030 df-iedg 29031 df-edg 29080 df-uhgr 29090 df-upgr 29114 df-umgr 29115 df-usgr 29183 |
This theorem is referenced by: fusgrfis 29362 cusgrres 29481 |
Copyright terms: Public domain | W3C validator |