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

Theorem uspgredg2v 26161
 Description: In a simple pseudograph, the mapping of edges having a fixed endpoint to the "other" vertex of the edge (which may be the fixed vertex itself in the case of a loop) is a one-to-one function into the set of vertices. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 6-Dec-2020.)
Hypotheses
Ref Expression
uspgredg2v.v 𝑉 = (Vtx‘𝐺)
uspgredg2v.e 𝐸 = (Edg‘𝐺)
uspgredg2v.a 𝐴 = {𝑒𝐸𝑁𝑒}
uspgredg2v.f 𝐹 = (𝑦𝐴 ↦ (𝑧𝑉 𝑦 = {𝑁, 𝑧}))
Assertion
Ref Expression
uspgredg2v ((𝐺 ∈ USPGraph ∧ 𝑁𝑉) → 𝐹:𝐴1-1𝑉)
Distinct variable groups:   𝑒,𝐸   𝑧,𝐺   𝑒,𝑁   𝑧,𝑁   𝑧,𝑉   𝑦,𝐴   𝑦,𝐺   𝑦,𝑁,𝑧   𝑦,𝑉   𝑦,𝑒
Allowed substitution hints:   𝐴(𝑧,𝑒)   𝐸(𝑦,𝑧)   𝐹(𝑦,𝑧,𝑒)   𝐺(𝑒)   𝑉(𝑒)

Proof of Theorem uspgredg2v
Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uspgredg2v.v . . . . 5 𝑉 = (Vtx‘𝐺)
2 uspgredg2v.e . . . . 5 𝐸 = (Edg‘𝐺)
3 uspgredg2v.a . . . . 5 𝐴 = {𝑒𝐸𝑁𝑒}
41, 2, 3uspgredg2vlem 26160 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝑦𝐴) → (𝑧𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
54ralrimiva 2995 . . 3 (𝐺 ∈ USPGraph → ∀𝑦𝐴 (𝑧𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
65adantr 480 . 2 ((𝐺 ∈ USPGraph ∧ 𝑁𝑉) → ∀𝑦𝐴 (𝑧𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
7 preq2 4301 . . . . . . 7 (𝑧 = 𝑛 → {𝑁, 𝑧} = {𝑁, 𝑛})
87eqeq2d 2661 . . . . . 6 (𝑧 = 𝑛 → (𝑦 = {𝑁, 𝑧} ↔ 𝑦 = {𝑁, 𝑛}))
98cbvriotav 6662 . . . . 5 (𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑛𝑉 𝑦 = {𝑁, 𝑛})
107eqeq2d 2661 . . . . . 6 (𝑧 = 𝑛 → (𝑥 = {𝑁, 𝑧} ↔ 𝑥 = {𝑁, 𝑛}))
1110cbvriotav 6662 . . . . 5 (𝑧𝑉 𝑥 = {𝑁, 𝑧}) = (𝑛𝑉 𝑥 = {𝑁, 𝑛})
12 simpl 472 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝑁𝑉) → 𝐺 ∈ USPGraph)
13 eleq2 2719 . . . . . . . . . . 11 (𝑒 = 𝑦 → (𝑁𝑒𝑁𝑦))
1413, 3elrab2 3399 . . . . . . . . . 10 (𝑦𝐴 ↔ (𝑦𝐸𝑁𝑦))
152eleq2i 2722 . . . . . . . . . . . 12 (𝑦𝐸𝑦 ∈ (Edg‘𝐺))
1615biimpi 206 . . . . . . . . . . 11 (𝑦𝐸𝑦 ∈ (Edg‘𝐺))
1716anim1i 591 . . . . . . . . . 10 ((𝑦𝐸𝑁𝑦) → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦))
1814, 17sylbi 207 . . . . . . . . 9 (𝑦𝐴 → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦))
1918adantr 480 . . . . . . . 8 ((𝑦𝐴𝑥𝐴) → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦))
2012, 19anim12i 589 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → (𝐺 ∈ USPGraph ∧ (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦)))
21 3anass 1059 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦) ↔ (𝐺 ∈ USPGraph ∧ (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦)))
2220, 21sylibr 224 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → (𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦))
23 uspgredg2vtxeu 26157 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦) → ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛})
24 reueq1 3170 . . . . . . . 8 (𝑉 = (Vtx‘𝐺) → (∃!𝑛𝑉 𝑦 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛}))
251, 24ax-mp 5 . . . . . . 7 (∃!𝑛𝑉 𝑦 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛})
2623, 25sylibr 224 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁𝑦) → ∃!𝑛𝑉 𝑦 = {𝑁, 𝑛})
2722, 26syl 17 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → ∃!𝑛𝑉 𝑦 = {𝑁, 𝑛})
28 eleq2 2719 . . . . . . . . . . 11 (𝑒 = 𝑥 → (𝑁𝑒𝑁𝑥))
2928, 3elrab2 3399 . . . . . . . . . 10 (𝑥𝐴 ↔ (𝑥𝐸𝑁𝑥))
302eleq2i 2722 . . . . . . . . . . . 12 (𝑥𝐸𝑥 ∈ (Edg‘𝐺))
3130biimpi 206 . . . . . . . . . . 11 (𝑥𝐸𝑥 ∈ (Edg‘𝐺))
3231anim1i 591 . . . . . . . . . 10 ((𝑥𝐸𝑁𝑥) → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥))
3329, 32sylbi 207 . . . . . . . . 9 (𝑥𝐴 → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥))
3433adantl 481 . . . . . . . 8 ((𝑦𝐴𝑥𝐴) → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥))
3512, 34anim12i 589 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥)))
36 3anass 1059 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥) ↔ (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥)))
3735, 36sylibr 224 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → (𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥))
38 uspgredg2vtxeu 26157 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥) → ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛})
39 reueq1 3170 . . . . . . . 8 (𝑉 = (Vtx‘𝐺) → (∃!𝑛𝑉 𝑥 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛}))
401, 39ax-mp 5 . . . . . . 7 (∃!𝑛𝑉 𝑥 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛})
4138, 40sylibr 224 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁𝑥) → ∃!𝑛𝑉 𝑥 = {𝑁, 𝑛})
4237, 41syl 17 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → ∃!𝑛𝑉 𝑥 = {𝑁, 𝑛})
439, 11, 27, 42riotaeqimp 6674 . . . 4 ((((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) ∧ (𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑧𝑉 𝑥 = {𝑁, 𝑧})) → 𝑦 = 𝑥)
4443ex 449 . . 3 (((𝐺 ∈ USPGraph ∧ 𝑁𝑉) ∧ (𝑦𝐴𝑥𝐴)) → ((𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑧𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥))
4544ralrimivva 3000 . 2 ((𝐺 ∈ USPGraph ∧ 𝑁𝑉) → ∀𝑦𝐴𝑥𝐴 ((𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑧𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥))
46 uspgredg2v.f . . 3 𝐹 = (𝑦𝐴 ↦ (𝑧𝑉 𝑦 = {𝑁, 𝑧}))
47 eqeq1 2655 . . . 4 (𝑦 = 𝑥 → (𝑦 = {𝑁, 𝑧} ↔ 𝑥 = {𝑁, 𝑧}))
4847riotabidv 6653 . . 3 (𝑦 = 𝑥 → (𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑧𝑉 𝑥 = {𝑁, 𝑧}))
4946, 48f1mpt 6558 . 2 (𝐹:𝐴1-1𝑉 ↔ (∀𝑦𝐴 (𝑧𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉 ∧ ∀𝑦𝐴𝑥𝐴 ((𝑧𝑉 𝑦 = {𝑁, 𝑧}) = (𝑧𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥)))
506, 45, 49sylanbrc 699 1 ((𝐺 ∈ USPGraph ∧ 𝑁𝑉) → 𝐹:𝐴1-1𝑉)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030  ∀wral 2941  ∃!wreu 2943  {crab 2945  {cpr 4212   ↦ cmpt 4762  –1-1→wf1 5923  ‘cfv 5926  ℩crio 6650  Vtxcvtx 25919  Edgcedg 25984  USPGraphcuspgr 26088 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-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-edg 25985  df-upgr 26022  df-uspgr 26090 This theorem is referenced by:  uspgredgleord  26169
 Copyright terms: Public domain W3C validator