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

Theorem cusgrexi 29169
Description: An arbitrary set 𝑉 regarded as set of vertices together with the set of pairs of elements of this set regarded as edges is a complete simple graph. (Contributed by Alexander van der Vekens, 12-Jan-2018.) (Revised by AV, 5-Nov-2020.) (Proof shortened by AV, 14-Feb-2022.)
Hypothesis
Ref Expression
usgrexi.p 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}
Assertion
Ref Expression
cusgrexi (𝑉𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph)
Distinct variable groups:   𝑥,𝑉   𝑥,𝑃   𝑥,𝑊

Proof of Theorem cusgrexi
Dummy variables 𝑒 𝑛 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 usgrexi.p . . 3 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}
21usgrexi 29167 . 2 (𝑉𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ USGraph)
31cusgrexilem1 29165 . . . . . . . . 9 (𝑉𝑊 → ( I ↾ 𝑃) ∈ V)
4 opvtxfv 28733 . . . . . . . . . 10 ((𝑉𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
54eqcomd 2730 . . . . . . . . 9 ((𝑉𝑊 ∧ ( I ↾ 𝑃) ∈ V) → 𝑉 = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
63, 5mpdan 684 . . . . . . . 8 (𝑉𝑊𝑉 = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
76eleq2d 2811 . . . . . . 7 (𝑉𝑊 → (𝑣𝑉𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
87biimpa 476 . . . . . 6 ((𝑉𝑊𝑣𝑉) → 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
9 eldifi 4118 . . . . . . . . . . . 12 (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛𝑉)
109adantl 481 . . . . . . . . . . 11 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛𝑉)
113, 4mpdan 684 . . . . . . . . . . . . 13 (𝑉𝑊 → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
1211eleq2d 2811 . . . . . . . . . . . 12 (𝑉𝑊 → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑛𝑉))
1312ad2antrr 723 . . . . . . . . . . 11 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑛𝑉))
1410, 13mpbird 257 . . . . . . . . . 10 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
15 simplr 766 . . . . . . . . . . 11 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣𝑉)
1611eleq2d 2811 . . . . . . . . . . . 12 (𝑉𝑊 → (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑣𝑉))
1716ad2antrr 723 . . . . . . . . . . 11 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑣𝑉))
1815, 17mpbird 257 . . . . . . . . . 10 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
1914, 18jca 511 . . . . . . . . 9 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
20 eldifsni 4785 . . . . . . . . . 10 (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛𝑣)
2120adantl 481 . . . . . . . . 9 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛𝑣)
221cusgrexilem2 29168 . . . . . . . . . 10 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒)
23 edgval 28778 . . . . . . . . . . . . 13 (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩)
24 opiedgfv 28736 . . . . . . . . . . . . . . 15 ((𝑉𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ( I ↾ 𝑃))
253, 24mpdan 684 . . . . . . . . . . . . . 14 (𝑉𝑊 → (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ( I ↾ 𝑃))
2625rneqd 5927 . . . . . . . . . . . . 13 (𝑉𝑊 → ran (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran ( I ↾ 𝑃))
2723, 26eqtrid 2776 . . . . . . . . . . . 12 (𝑉𝑊 → (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran ( I ↾ 𝑃))
2827rexeqdv 3318 . . . . . . . . . . 11 (𝑉𝑊 → (∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒))
2928ad2antrr 723 . . . . . . . . . 10 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒))
3022, 29mpbird 257 . . . . . . . . 9 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒)
31 eqid 2724 . . . . . . . . . 10 (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)
32 eqid 2724 . . . . . . . . . 10 (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩)
3331, 32nbgrel 29066 . . . . . . . . 9 (𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣) ↔ ((𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)) ∧ 𝑛𝑣 ∧ ∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒))
3419, 21, 30, 33syl3anbrc 1340 . . . . . . . 8 (((𝑉𝑊𝑣𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
3534ralrimiva 3138 . . . . . . 7 ((𝑉𝑊𝑣𝑉) → ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
3611adantr 480 . . . . . . . . 9 ((𝑉𝑊𝑣𝑉) → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
3736difeq1d 4113 . . . . . . . 8 ((𝑉𝑊𝑣𝑉) → ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣}) = (𝑉 ∖ {𝑣}))
3837raleqdv 3317 . . . . . . 7 ((𝑉𝑊𝑣𝑉) → (∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣)))
3935, 38mpbird 257 . . . . . 6 ((𝑉𝑊𝑣𝑉) → ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
4031uvtxel 29114 . . . . . 6 (𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣)))
418, 39, 40sylanbrc 582 . . . . 5 ((𝑉𝑊𝑣𝑉) → 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
4241ralrimiva 3138 . . . 4 (𝑉𝑊 → ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
4311raleqdv 3317 . . . 4 (𝑉𝑊 → (∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ ∀𝑣𝑉 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
4442, 43mpbird 257 . . 3 (𝑉𝑊 → ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
45 opex 5454 . . . 4 𝑉, ( I ↾ 𝑃)⟩ ∈ V
4631iscplgr 29141 . . . 4 (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V → (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph ↔ ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
4745, 46mp1i 13 . . 3 (𝑉𝑊 → (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph ↔ ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
4844, 47mpbird 257 . 2 (𝑉𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph)
49 iscusgr 29144 . 2 (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph ↔ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ USGraph ∧ ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph))
502, 48, 49sylanbrc 582 1 (𝑉𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1533  wcel 2098  wne 2932  wral 3053  wrex 3062  {crab 3424  Vcvv 3466  cdif 3937  wss 3940  𝒫 cpw 4594  {csn 4620  {cpr 4622  cop 4626   I cid 5563  ran crn 5667  cres 5668  cfv 6533  (class class class)co 7401  2c2 12264  chash 14287  Vtxcvtx 28725  iEdgciedg 28726  Edgcedg 28776  USGraphcusgr 28878   NeighbVtx cnbgr 29058  UnivVtxcuvtx 29111  ComplGraphccplgr 29135  ComplUSGraphccusgr 29136
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-nel 3039  df-ral 3054  df-rex 3063  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3959  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6290  df-ord 6357  df-on 6358  df-lim 6359  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7357  df-ov 7404  df-oprab 7405  df-mpo 7406  df-om 7849  df-1st 7968  df-2nd 7969  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-rdg 8405  df-1o 8461  df-oadd 8465  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-dju 9892  df-card 9930  df-pnf 11247  df-mnf 11248  df-xr 11249  df-ltxr 11250  df-le 11251  df-sub 11443  df-neg 11444  df-nn 12210  df-2 12272  df-n0 12470  df-z 12556  df-uz 12820  df-fz 13482  df-hash 14288  df-vtx 28727  df-iedg 28728  df-edg 28777  df-usgr 28880  df-nbgr 29059  df-uvtx 29112  df-cplgr 29137  df-cusgr 29138
This theorem is referenced by:  cusgrexg  29170
  Copyright terms: Public domain W3C validator