MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cusgrres Structured version   Visualization version   GIF version

Theorem cusgrres 26400
Description: Restricting a complete simple graph. (Contributed by Alexander van der Vekens, 2-Jan-2018.)
Hypotheses
Ref Expression
cusgrres.v 𝑉 = (Vtx‘𝐺)
cusgrres.e 𝐸 = (Edg‘𝐺)
cusgrres.f 𝐹 = {𝑒𝐸𝑁𝑒}
cusgrres.s 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩
Assertion
Ref Expression
cusgrres ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ ComplUSGraph)
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁   𝑒,𝑉
Allowed substitution hints:   𝑆(𝑒)   𝐹(𝑒)

Proof of Theorem cusgrres
Dummy variables 𝑛 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cusgrusgr 26371 . . 3 (𝐺 ∈ ComplUSGraph → 𝐺 ∈ USGraph)
2 cusgrres.v . . . 4 𝑉 = (Vtx‘𝐺)
3 cusgrres.e . . . 4 𝐸 = (Edg‘𝐺)
4 cusgrres.f . . . 4 𝐹 = {𝑒𝐸𝑁𝑒}
5 cusgrres.s . . . 4 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩
62, 3, 4, 5usgrres1 26252 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → 𝑆 ∈ USGraph)
71, 6sylan 487 . 2 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ USGraph)
8 iscusgr 26370 . . . 4 (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))
9 usgrupgr 26122 . . . . . . . . 9 (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph)
109adantr 480 . . . . . . . 8 ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → 𝐺 ∈ UPGraph)
1110anim1i 591 . . . . . . 7 (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) → (𝐺 ∈ UPGraph ∧ 𝑁𝑉))
1211anim1i 591 . . . . . 6 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})))
132iscplgr 26366 . . . . . . . . 9 (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ ∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺)))
14 eldifi 3765 . . . . . . . . . . . . 13 (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣𝑉)
1514ad2antll 765 . . . . . . . . . . . 12 ((𝐺 ∈ USGraph ∧ (𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁}))) → 𝑣𝑉)
16 eleq1 2718 . . . . . . . . . . . . 13 (𝑛 = 𝑣 → (𝑛 ∈ (UnivVtx‘𝐺) ↔ 𝑣 ∈ (UnivVtx‘𝐺)))
1716rspcv 3336 . . . . . . . . . . . 12 (𝑣𝑉 → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))
1815, 17syl 17 . . . . . . . . . . 11 ((𝐺 ∈ USGraph ∧ (𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁}))) → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))
1918ex 449 . . . . . . . . . 10 (𝐺 ∈ USGraph → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))))
2019com23 86 . . . . . . . . 9 (𝐺 ∈ USGraph → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))))
2113, 20sylbid 230 . . . . . . . 8 (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))))
2221imp 444 . . . . . . 7 ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))
2322impl 649 . . . . . 6 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))
242, 3, 4, 5uvtxupgrres 26359 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (𝑣 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝑆)))
2512, 23, 24sylc 65 . . . . 5 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝑆))
2625ralrimiva 2995 . . . 4 (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))
278, 26sylanb 488 . . 3 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))
28 opex 4962 . . . . 5 ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩ ∈ V
295, 28eqeltri 2726 . . . 4 𝑆 ∈ V
302, 3, 4, 5upgrres1lem2 26248 . . . . . 6 (Vtx‘𝑆) = (𝑉 ∖ {𝑁})
3130eqcomi 2660 . . . . 5 (𝑉 ∖ {𝑁}) = (Vtx‘𝑆)
3231iscplgr 26366 . . . 4 (𝑆 ∈ V → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)))
3329, 32mp1i 13 . . 3 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)))
3427, 33mpbird 247 . 2 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ ComplGraph)
35 iscusgr 26370 . 2 (𝑆 ∈ ComplUSGraph ↔ (𝑆 ∈ USGraph ∧ 𝑆 ∈ ComplGraph))
367, 34, 35sylanbrc 699 1 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ ComplUSGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1523  wcel 2030  wnel 2926  wral 2941  {crab 2945  Vcvv 3231  cdif 3604  {csn 4210  cop 4216   I cid 5052  cres 5145  cfv 5926  Vtxcvtx 25919  Edgcedg 25984  UPGraphcupgr 26020  USGraphcusgr 26089  UnivVtxcuvtx 26331  ComplGraphccplgr 26360  ComplUSGraphccusgr 26361
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-card 8803  df-cda 9028  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-2 11117  df-n0 11331  df-xnn0 11402  df-z 11416  df-uz 11726  df-fz 12365  df-hash 13158  df-vtx 25921  df-iedg 25922  df-edg 25985  df-uhgr 25998  df-upgr 26022  df-umgr 26023  df-uspgr 26090  df-usgr 26091  df-nbgr 26270  df-uvtx 26332  df-cplgr 26362  df-cusgr 26363
This theorem is referenced by:  cusgrsize  26406
  Copyright terms: Public domain W3C validator