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

Theorem uspgredg2v 29862
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 29861 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
54ralrimiva 3158 . . 3 (𝐺 ∈ USPGraph → ∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
65adantr 486 . 2 ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉)
7 preq2 4697 . . . . . . 7 (𝑧 = 𝑛 → {𝑁, 𝑧} = {𝑁, 𝑛})
87eqeq2d 2774 . . . . . 6 (𝑧 = 𝑛 → (𝑦 = {𝑁, 𝑧} ↔ 𝑦 = {𝑁, 𝑛}))
98cbvriotavw 7418 . . . . 5 (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑛 ∈ 𝑉 𝑦 = {𝑁, 𝑛})
107eqeq2d 2774 . . . . . 6 (𝑧 = 𝑛 → (𝑥 = {𝑁, 𝑧} ↔ 𝑥 = {𝑁, 𝑛}))
1110cbvriotavw 7418 . . . . 5 (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧}) = (℩𝑛 ∈ 𝑉 𝑥 = {𝑁, 𝑛})
12 simpl 488 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) → 𝐺 ∈ USPGraph)
13 eleq2w 2848 . . . . . . . . . . 11 (𝑒 = 𝑦 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑦))
1413, 3elrab2 3652 . . . . . . . . . 10 (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ 𝐸 ∧ 𝑁 ∈ 𝑦))
152eleq2i 2856 . . . . . . . . . . . 12 (𝑦 ∈ 𝐸 ↔ 𝑦 ∈ (Edg‘𝐺))
1615biimpi 219 . . . . . . . . . . 11 (𝑦 ∈ 𝐸 → 𝑦 ∈ (Edg‘𝐺))
1716anim1i 627 . . . . . . . . . 10 ((𝑦 ∈ 𝐸 ∧ 𝑁 ∈ 𝑦) → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦))
1814, 17sylbi 220 . . . . . . . . 9 (𝑦 ∈ 𝐴 → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦))
1918adantr 486 . . . . . . . 8 ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦))
2012, 19anim12i 625 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → (𝐺 ∈ USPGraph ∧ (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦)))
21 3anass 1111 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦) ↔ (𝐺 ∈ USPGraph ∧ (𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦)))
2220, 21sylibr 237 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → (𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦))
23 uspgredg2vtxeu 29858 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦) → ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛})
24 reueq1 3401 . . . . . . . 8 (𝑉 = (Vtx‘𝐺) → (∃!𝑛 ∈ 𝑉 𝑦 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛}))
251, 24ax-mp 5 . . . . . . 7 (∃!𝑛 ∈ 𝑉 𝑦 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑦 = {𝑁, 𝑛})
2623, 25sylibr 237 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑦) → ∃!𝑛 ∈ 𝑉 𝑦 = {𝑁, 𝑛})
2722, 26syl 18 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → ∃!𝑛 ∈ 𝑉 𝑦 = {𝑁, 𝑛})
28 eleq2w 2848 . . . . . . . . . . 11 (𝑒 = 𝑥 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑥))
2928, 3elrab2 3652 . . . . . . . . . 10 (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐸 ∧ 𝑁 ∈ 𝑥))
302eleq2i 2856 . . . . . . . . . . . 12 (𝑥 ∈ 𝐸 ↔ 𝑥 ∈ (Edg‘𝐺))
3130biimpi 219 . . . . . . . . . . 11 (𝑥 ∈ 𝐸 → 𝑥 ∈ (Edg‘𝐺))
3231anim1i 627 . . . . . . . . . 10 ((𝑥 ∈ 𝐸 ∧ 𝑁 ∈ 𝑥) → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥))
3329, 32sylbi 220 . . . . . . . . 9 (𝑥 ∈ 𝐴 → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥))
3433adantl 487 . . . . . . . 8 ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥))
3512, 34anim12i 625 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥)))
36 3anass 1111 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥) ↔ (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥)))
3735, 36sylibr 237 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → (𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥))
38 uspgredg2vtxeu 29858 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥) → ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛})
39 reueq1 3401 . . . . . . . 8 (𝑉 = (Vtx‘𝐺) → (∃!𝑛 ∈ 𝑉 𝑥 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛}))
401, 39ax-mp 5 . . . . . . 7 (∃!𝑛 ∈ 𝑉 𝑥 = {𝑁, 𝑛} ↔ ∃!𝑛 ∈ (Vtx‘𝐺)𝑥 = {𝑁, 𝑛})
4138, 40sylibr 237 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝑥 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑥) → ∃!𝑛 ∈ 𝑉 𝑥 = {𝑁, 𝑛})
4237, 41syl 18 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → ∃!𝑛 ∈ 𝑉 𝑥 = {𝑁, 𝑛})
439, 11, 27, 42riotaeqimp 7434 . . . 4 ((((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧})) → 𝑦 = 𝑥)
4443ex 418 . . 3 (((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → ((℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥))
4544ralrimivva 3209 . 2 ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ((℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥))
46 uspgredg2v.f . . 3 𝐹 = (𝑦 ∈ 𝐴 ↦ (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}))
47 eqeq1 2767 . . . 4 (𝑦 = 𝑥 → (𝑦 = {𝑁, 𝑧} ↔ 𝑥 = {𝑁, 𝑧}))
4847riotabidv 7410 . . 3 (𝑦 = 𝑥 → (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧}))
4946, 48f1mpt 7296 . 2 (𝐹:𝐴⟶1-1𝑉 ↔ (∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ((℩𝑧 ∈ 𝑉 𝑦 = {𝑁, 𝑧}) = (℩𝑧 ∈ 𝑉 𝑥 = {𝑁, 𝑧}) → 𝑦 = 𝑥)))
506, 45, 49sylanbrc 595 1 ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴⟶1-1𝑉)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  {crab 3416  {cpr 4590   ↦ cmpt 5192  ⟶1-1wf1 6563  ‘cfv 6566  ℩crio 7407  Vtxcvtx 29631  Edgcedg 29682  USPGraphcuspgr 29786
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516  df-edg 29683  df-upgr 29717  df-uspgr 29788
This theorem is used by:  uspgredgleord  29870
  Copyright terms: Public domain W3C validator