| 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 29475 | . . 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 29371 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 7 | 1, 6 | sylan 581 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ USGraph) |
| 8 | iscusgr 29474 | . . . 4 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph)) | |
| 9 | usgrupgr 29241 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph) | |
| 10 | 9 | adantr 480 | . . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → 𝐺 ∈ UPGraph) |
| 11 | 10 | anim1i 616 | . . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → (𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉)) |
| 12 | 11 | anim1i 616 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) |
| 13 | 2 | iscplgr 29471 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ ∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺))) |
| 14 | eldifi 4084 | . . . . . . . . . . . . 13 ⊢ (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣 ∈ 𝑉) | |
| 15 | 14 | ad2antll 730 | . . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → 𝑣 ∈ 𝑉) |
| 16 | eleq1w 2820 | . . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑣 → (𝑛 ∈ (UnivVtx‘𝐺) ↔ 𝑣 ∈ (UnivVtx‘𝐺))) | |
| 17 | 16 | rspcv 3573 | . . . . . . . . . . . 12 ⊢ (𝑣 ∈ 𝑉 → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 18 | 15, 17 | syl 17 | . . . . . . . . . . 11 ⊢ ((𝐺 ∈ USGraph ∧ (𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁}))) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 19 | 18 | ex 412 | . . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 20 | 19 | com23 86 | . . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (∀𝑛 ∈ 𝑉 𝑛 ∈ (UnivVtx‘𝐺) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 21 | 13, 20 | sylbid 240 | . . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))) |
| 22 | 21 | imp 406 | . . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → ((𝑁 ∈ 𝑉 ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))) |
| 23 | 22 | impl 455 | . . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)) |
| 24 | 2, 3, 4, 5 | uvtxupgrres 29464 | . . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (𝑣 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝑆))) |
| 25 | 12, 23, 24 | sylc 65 | . . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝑆)) |
| 26 | 25 | ralrimiva 3129 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 27 | 8, 26 | sylanb 582 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)) |
| 28 | opex 5413 | . . . . 5 ⊢ 〈(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)〉 ∈ V | |
| 29 | 5, 28 | eqeltri 2833 | . . . 4 ⊢ 𝑆 ∈ V |
| 30 | 2, 3, 4, 5 | upgrres1lem2 29367 | . . . . . 6 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁}) |
| 31 | 30 | eqcomi 2746 | . . . . 5 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
| 32 | 31 | iscplgr 29471 | . . . 4 ⊢ (𝑆 ∈ V → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 33 | 29, 32 | mp1i 13 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))) |
| 34 | 27, 33 | mpbird 257 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplGraph) |
| 35 | iscusgr 29474 | . 2 ⊢ (𝑆 ∈ ComplUSGraph ↔ (𝑆 ∈ USGraph ∧ 𝑆 ∈ ComplGraph)) | |
| 36 | 7, 34, 35 | sylanbrc 584 | 1 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ ComplUSGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∉ wnel 3037 ∀wral 3052 {crab 3400 Vcvv 3441 ∖ cdif 3899 {csn 4581 〈cop 4587 I cid 5519 ↾ cres 5627 ‘cfv 6493 Vtxcvtx 29052 Edgcedg 29103 UPGraphcupgr 29136 USGraphcusgr 29205 UnivVtxcuvtx 29441 ComplGraphccplgr 29465 ComplUSGraphccusgr 29466 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9817 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-n0 12406 df-xnn0 12479 df-z 12493 df-uz 12756 df-fz 13428 df-hash 14258 df-vtx 29054 df-iedg 29055 df-edg 29104 df-uhgr 29114 df-upgr 29138 df-umgr 29139 df-uspgr 29206 df-usgr 29207 df-nbgr 29389 df-uvtx 29442 df-cplgr 29467 df-cusgr 29468 |
| This theorem is referenced by: cusgrsize 29511 |
| Copyright terms: Public domain | W3C validator |