Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cusgrres Structured version   Visualization version   GIF version

Theorem cusgrres 40664
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 40641 . . 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 40534 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → 𝑆 ∈ USGraph )
71, 6sylan 487 . 2 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ USGraph )
8 iscusgr 40640 . . . 4 (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))
9 usgrupgr 40412 . . . . . . . . 9 (𝐺 ∈ USGraph → 𝐺 ∈ UPGraph )
109adantr 480 . . . . . . . 8 ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → 𝐺 ∈ UPGraph )
1110anim1i 590 . . . . . . 7 (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) → (𝐺 ∈ UPGraph ∧ 𝑁𝑉))
1211anim1i 590 . . . . . 6 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})))
132iscplgr 40636 . . . . . . . . 9 (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ ∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺)))
14 eldifi 3694 . . . . . . . . . . . . 13 (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣𝑉)
1514ad2antll 761 . . . . . . . . . . . 12 ((𝐺 ∈ USGraph ∧ (𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁}))) → 𝑣𝑉)
16 eleq1 2676 . . . . . . . . . . . . 13 (𝑛 = 𝑣 → (𝑛 ∈ (UnivVtx‘𝐺) ↔ 𝑣 ∈ (UnivVtx‘𝐺)))
1716rspcv 3278 . . . . . . . . . . . 12 (𝑣𝑉 → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))
1815, 17syl 17 . . . . . . . . . . 11 ((𝐺 ∈ USGraph ∧ (𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁}))) → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺)))
1918ex 449 . . . . . . . . . 10 (𝐺 ∈ USGraph → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝐺))))
2019com23 84 . . . . . . . . 9 (𝐺 ∈ USGraph → (∀𝑛𝑉 𝑛 ∈ (UnivVtx‘𝐺) → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))))
2113, 20sylbid 229 . . . . . . . 8 (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))))
2221imp 444 . . . . . . 7 ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) → ((𝑁𝑉𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺)))
2322impl 648 . . . . . 6 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝐺))
242, 3, 4, 5uvtxupgrres 40635 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (𝑣 ∈ (UnivVtx‘𝐺) → 𝑣 ∈ (UnivVtx‘𝑆)))
2512, 23, 24sylc 63 . . . . 5 ((((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → 𝑣 ∈ (UnivVtx‘𝑆))
2625ralrimiva 2949 . . . 4 (((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ∧ 𝑁𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))
278, 26sylanb 488 . . 3 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆))
28 opex 4859 . . . . 5 ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩ ∈ V
295, 28eqeltri 2684 . . . 4 𝑆 ∈ V
302, 3, 4, 5upgrres1lem2 40530 . . . . . 6 (Vtx‘𝑆) = (𝑉 ∖ {𝑁})
3130eqcomi 2619 . . . . 5 (𝑉 ∖ {𝑁}) = (Vtx‘𝑆)
3231iscplgr 40636 . . . 4 (𝑆 ∈ V → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)))
3329, 32mp1i 13 . . 3 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → (𝑆 ∈ ComplGraph ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ (UnivVtx‘𝑆)))
3427, 33mpbird 246 . 2 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ ComplGraph)
35 iscusgr 40640 . 2 (𝑆 ∈ ComplUSGraph ↔ (𝑆 ∈ USGraph ∧ 𝑆 ∈ ComplGraph))
367, 34, 35sylanbrc 695 1 ((𝐺 ∈ ComplUSGraph ∧ 𝑁𝑉) → 𝑆 ∈ ComplUSGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wnel 2781  wral 2896  {crab 2900  Vcvv 3173  cdif 3537  {csn 4125  cop 4131   I cid 4948  cres 5040  cfv 5804  Vtxcvtx 25673   UPGraph cupgr 25747  Edgcedga 25792   USGraph cusgr 40379  UnivVtxcuvtxa 40551  ComplGraphccplgr 40552  ComplUSGraphccusgr 40553
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-hash 12980  df-vtx 25675  df-iedg 25676  df-uhgr 25724  df-upgr 25749  df-umgr 25750  df-edga 25793  df-uspgr 40380  df-usgr 40381  df-nbgr 40554  df-uvtxa 40556  df-cplgr 40557  df-cusgr 40558
This theorem is referenced by:  cusgrsize  40670
  Copyright terms: Public domain W3C validator