| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cusgrres | Structured version Visualization version GIF version | ||
| Description: Restricting a complete simple graph. (Contributed by Alexander van der Vekens, 2-Jan-2018.) |
| Ref | Expression |
|---|---|
| cusgrres.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| cusgrres.e | ⊢ 𝐸 = (Edg‘𝐺) |
| cusgrres.f | ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} |
| cusgrres.s | ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 |
| Ref | Expression |
|---|---|
| cusgrres | ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplUSGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cusgrusgr 30030 | . . 3 ⊢ (𝐺 ∈ ComplUSGraph → 𝐺 ∈ USGraph) | |
| 2 | cusgrres.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | cusgrres.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 4 | cusgrres.f | . . . 4 ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} | |
| 5 | cusgrres.s | . . . 4 ⊢ 𝑆 = 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 | |
| 6 | 2, 3, 4, 5 | usgrres1 29926 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 7 | 1, 6 | sylan 592 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 8 | iscusgr 30029 | . . . 4 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph)) | |
| 9 | usgrupgr 29796 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph) | |
| 10 | 9 | adantr 486 | . . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → 𝐺 ∈ UPGraph) |
| 11 | 10 | anim1i 627 | . . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → (𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉)) |
| 12 | 11 | anim1i 627 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) |
| 13 | 2 | iscplgr 30026 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ ∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺))) |
| 14 | eldifi 4070 | . . . . . . . . . . . . 13 ⊢ (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣 ∈ 𝑉) | |
| 15 | 14 | ad2antll 742 | . . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → 𝑣 ∈ 𝑉) |
| 16 | eleq1w 2847 | . . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑣 → (𝑛 ∈ (UnivVtx‘𝐺) ↔ 𝑣 ∈ (UnivVtx‘𝐺))) | |
| 17 | 16 | rspcv 3576 | . . . . . . . . . . . 12 ⊢ (𝑣 ∈ 𝑉 → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 18 | 15, 17 | syl 18 | . . . . . . . . . . 11 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 19 | 18 | ex 418 | . . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 20 | 19 | com23 87 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 21 | 13, 20 | sylbid 243 | . . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 22 | 21 | imp 412 | . . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 23 | 22 | impl 461 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)) |
| 24 | 2, 3, 4, 5 | uvtxupgrres 30019 | . . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (𝑣 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝑆))) |
| 25 | 12, 23, 24 | sylc 66 | . . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝑆)) |
| 26 | 25 | ralrimiva 3158 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 27 | 8, 26 | sylanb 593 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 28 | opex 5436 | . . . . 5 ⊢ 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 ∈ V | |
| 29 | 5, 28 | eqeltri 2860 | . . . 4 ⊢ 𝑆 ∈ V |
| 30 | 2, 3, 4, 5 | upgrres1lem2 29922 | . . . . . 6 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁}) |
| 31 | 30 | eqcomi 2772 | . . . . 5 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
| 32 | 31 | iscplgr 30026 | . . . 4 ⊢ (𝑆 ∈ V → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 33 | 29, 32 | mp1i 14 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 34 | 27, 33 | mpbird 260 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplGraph) |
| 35 | iscusgr 30029 | . 2 ⊢ (𝑆 ∈ ComplUSGraph ↔ (𝑆 ∈ USGraph ∧ 𝑆 ∈ ComplGraph)) | |
| 36 | 7, 34, 35 | sylanbrc 595 | 1 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplUSGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∉ wnel 3065 ∀wral 3080 {crab 3416 Vcvv 3454 ∖ cdif 4048 {csn 4588 〈cop 4838 I cid 5549 ↾ cres 5657 ‘cfv 6558 Vtxcvtx 29604 Edgcedg 29655 UPGraphcupgr 29688 USGraphcusgr 29760 UnivVtxcuvtx 29996 ComplGraphccplgr 30020 ComplUSGraphccusgr 30021 |
| 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 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 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 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-oadd 8508 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-dju 10009 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-n0 12634 df-xnn0 12707 df-z 12721 df-uz 12993 df-fz 13667 df-hash 14502 df-vtx 29606 df-iedg 29607 df-edg 29656 df-uhgr 29666 df-upgr 29690 df-umgr 29691 df-uspgr 29761 df-usgr 29762 df-nbgr 29944 df-uvtx 29997 df-cplgr 30022 df-cusgr 30023 |
| This theorem is used by: cusgrsize 30065 |
| Copyright terms: Public domain | W3C validator |