| 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 29559 | . . 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 29455 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 7 | 1, 6 | sylan 588 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 8 | iscusgr 29558 | . . . 4 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph)) | |
| 9 | usgrupgr 29325 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph) | |
| 10 | 9 | adantr 483 | . . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → 𝐺 ∈ UPGraph) |
| 11 | 10 | anim1i 623 | . . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → (𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉)) |
| 12 | 11 | anim1i 623 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) |
| 13 | 2 | iscplgr 29555 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ ∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺))) |
| 14 | eldifi 4079 | . . . . . . . . . . . . 13 ⊢ (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣 ∈ 𝑉) | |
| 15 | 14 | ad2antll 737 | . . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → 𝑣 ∈ 𝑉) |
| 16 | eleq1w 2839 | . . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑣 → (𝑛 ∈ (UnivVtx‘𝐺) ↔ 𝑣 ∈ (UnivVtx‘𝐺))) | |
| 17 | 16 | rspcv 3572 | . . . . . . . . . . . 12 ⊢ (𝑣 ∈ 𝑉 → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 18 | 15, 17 | syl 17 | . . . . . . . . . . 11 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 19 | 18 | ex 415 | . . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 20 | 19 | com23 86 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 21 | 13, 20 | sylbid 242 | . . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 22 | 21 | imp 409 | . . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 23 | 22 | impl 458 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)) |
| 24 | 2, 3, 4, 5 | uvtxupgrres 29548 | . . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (𝑣 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝑆))) |
| 25 | 12, 23, 24 | sylc 65 | . . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝑆)) |
| 26 | 25 | ralrimiva 3148 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 27 | 8, 26 | sylanb 589 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 28 | opex 5425 | . . . . 5 ⊢ 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 ∈ V | |
| 29 | 5, 28 | eqeltri 2852 | . . . 4 ⊢ 𝑆 ∈ V |
| 30 | 2, 3, 4, 5 | upgrres1lem2 29451 | . . . . . 6 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁}) |
| 31 | 30 | eqcomi 2765 | . . . . 5 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
| 32 | 31 | iscplgr 29555 | . . . 4 ⊢ (𝑆 ∈ V → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 33 | 29, 32 | mp1i 13 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 34 | 27, 33 | mpbird 259 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplGraph) |
| 35 | iscusgr 29558 | . 2 ⊢ (𝑆 ∈ ComplUSGraph ↔ (𝑆 ∈ USGraph ∧ 𝑆 ∈ ComplGraph)) | |
| 36 | 7, 34, 35 | sylanbrc 591 | 1 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplUSGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ∉ wnel 3055 ∀wral 3070 {crab 3408 Vcvv 3448 ∖ cdif 3896 {csn 4576 〈cop 4582 I cid 5534 ↾ cres 5642 ‘cfv 6510 Vtxcvtx 29136 Edgcedg 29187 UPGraphcupgr 29220 USGraphcusgr 29289 UnivVtxcuvtx 29525 ComplGraphccplgr 29549 ComplUSGraphccusgr 29550 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-2o 8426 df-oadd 8429 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-dju 9849 df-card 9887 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-n0 12472 df-xnn0 12545 df-z 12559 df-uz 12830 df-fz 13503 df-hash 14334 df-vtx 29138 df-iedg 29139 df-edg 29188 df-uhgr 29198 df-upgr 29222 df-umgr 29223 df-uspgr 29290 df-usgr 29291 df-nbgr 29473 df-uvtx 29526 df-cplgr 29551 df-cusgr 29552 |
| This theorem is referenced by: cusgrsize 29594 |
| Copyright terms: Public domain | W3C validator |