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

Theorem wlkswwlksf1o 30468
Description: The mapping of (ordinary) walks to their sequences of vertices is a bijection in a simple pseudograph. (Contributed by AV, 6-May-2021.)
Hypothesis
Ref Expression
wlkswwlksf1o.f 𝐹 = (𝑤 ∈ (Walks‘𝐺) ↦ (2nd ‘𝑤))
Assertion
Ref Expression
wlkswwlksf1o (𝐺 ∈ USPGraph → 𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺))
Distinct variable group:   𝑤,𝐺
Allowed substitution hint:   𝐹(𝑤)

Proof of Theorem wlkswwlksf1o
Dummy variables 𝑥 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6898 . . . . . 6 (1st ‘𝑤) ∈ V
2 breq1 5105 . . . . . 6 (𝑓 = (1st ‘𝑤) → (𝑓(Walks‘𝐺)(2nd ‘𝑤) ↔ (1st ‘𝑤)(Walks‘𝐺)(2nd ‘𝑤)))
31, 2spcev 3560 . . . . 5 ((1st ‘𝑤)(Walks‘𝐺)(2nd ‘𝑤) → ∃𝑓 𝑓(Walks‘𝐺)(2nd ‘𝑤))
4 wlkiswwlks 30465 . . . . 5 (𝐺 ∈ USPGraph → (∃𝑓 𝑓(Walks‘𝐺)(2nd ‘𝑤) ↔ (2nd ‘𝑤) ∈ (WWalks‘𝐺)))
53, 4imbitrid 247 . . . 4 (𝐺 ∈ USPGraph → ((1st ‘𝑤)(Walks‘𝐺)(2nd ‘𝑤) → (2nd ‘𝑤) ∈ (WWalks‘𝐺)))
6 wlkcpr 30209 . . . . 5 (𝑤 ∈ (Walks‘𝐺) ↔ (1st ‘𝑤)(Walks‘𝐺)(2nd ‘𝑤))
76biimpi 219 . . . 4 (𝑤 ∈ (Walks‘𝐺) → (1st ‘𝑤)(Walks‘𝐺)(2nd ‘𝑤))
85, 7impel 515 . . 3 ((𝐺 ∈ USPGraph ∧ 𝑤 ∈ (Walks‘𝐺)) → (2nd ‘𝑤) ∈ (WWalks‘𝐺))
9 wlkswwlksf1o.f . . 3 𝐹 = (𝑤 ∈ (Walks‘𝐺) ↦ (2nd ‘𝑤))
108, 9fmptd 7114 . 2 (𝐺 ∈ USPGraph → 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺))
11 simpr 490 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺))
12 fveq2 6885 . . . . . . . . 9 (𝑤 = 𝑥 → (2nd ‘𝑤) = (2nd ‘𝑥))
13 id 23 . . . . . . . . 9 (𝑥 ∈ (Walks‘𝐺) → 𝑥 ∈ (Walks‘𝐺))
14 fvexd 6900 . . . . . . . . 9 (𝑥 ∈ (Walks‘𝐺) → (2nd ‘𝑥) ∈ V)
159, 12, 13, 14fvmptd3 7017 . . . . . . . 8 (𝑥 ∈ (Walks‘𝐺) → (𝐹‘𝑥) = (2nd ‘𝑥))
16 fveq2 6885 . . . . . . . . 9 (𝑤 = 𝑦 → (2nd ‘𝑤) = (2nd ‘𝑦))
17 id 23 . . . . . . . . 9 (𝑦 ∈ (Walks‘𝐺) → 𝑦 ∈ (Walks‘𝐺))
18 fvexd 6900 . . . . . . . . 9 (𝑦 ∈ (Walks‘𝐺) → (2nd ‘𝑦) ∈ V)
199, 16, 17, 18fvmptd3 7017 . . . . . . . 8 (𝑦 ∈ (Walks‘𝐺) → (𝐹‘𝑦) = (2nd ‘𝑦))
2015, 19eqeqan12d 2774 . . . . . . 7 ((𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (2nd ‘𝑥) = (2nd ‘𝑦)))
2120adantl 487 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (2nd ‘𝑥) = (2nd ‘𝑦)))
22 uspgr2wlkeqi 30228 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) ∧ (2nd ‘𝑥) = (2nd ‘𝑦)) → 𝑥 = 𝑦)
2322ad4ant134 1193 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) ∧ (2nd ‘𝑥) = (2nd ‘𝑦)) → 𝑥 = 𝑦)
2423ex 418 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((2nd ‘𝑥) = (2nd ‘𝑦) → 𝑥 = 𝑦))
2521, 24sylbid 243 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
2625ralrimivva 3205 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → ∀𝑥 ∈ (Walks‘𝐺)∀𝑦 ∈ (Walks‘𝐺)((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
27 dff13 7258 . . . 4 (𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺) ∧ ∀𝑥 ∈ (Walks‘𝐺)∀𝑦 ∈ (Walks‘𝐺)((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
2811, 26, 27sylanbrc 595 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺))
29 wlkiswwlks 30465 . . . . . . . . . 10 (𝐺 ∈ USPGraph → (∃𝑓 𝑓(Walks‘𝐺)𝑦 ↔ 𝑦 ∈ (WWalks‘𝐺)))
3029adantr 486 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → (∃𝑓 𝑓(Walks‘𝐺)𝑦 ↔ 𝑦 ∈ (WWalks‘𝐺)))
31 df-br 5103 . . . . . . . . . . 11 (𝑓(Walks‘𝐺)𝑦 ↔ ⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺))
32 vex 3454 . . . . . . . . . . . . . 14 𝑓 ∈ V
33 vex 3454 . . . . . . . . . . . . . 14 𝑦 ∈ V
3432, 33op2nd 8010 . . . . . . . . . . . . 13 (2nd ‘⟨𝑓, 𝑦⟩) = 𝑦
3534eqcomi 2769 . . . . . . . . . . . 12 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)
36 opex 5431 . . . . . . . . . . . . 13 ⟨𝑓, 𝑦⟩ ∈ V
37 eleq1 2848 . . . . . . . . . . . . . 14 (𝑥 = ⟨𝑓, 𝑦⟩ → (𝑥 ∈ (Walks‘𝐺) ↔ ⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺)))
38 fveq2 6885 . . . . . . . . . . . . . . 15 (𝑥 = ⟨𝑓, 𝑦⟩ → (2nd ‘𝑥) = (2nd ‘⟨𝑓, 𝑦⟩))
3938eqeq2d 2771 . . . . . . . . . . . . . 14 (𝑥 = ⟨𝑓, 𝑦⟩ → (𝑦 = (2nd ‘𝑥) ↔ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)))
4037, 39anbi12d 644 . . . . . . . . . . . . 13 (𝑥 = ⟨𝑓, 𝑦⟩ → ((𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)) ↔ (⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩))))
4136, 40spcev 3560 . . . . . . . . . . . 12 ((⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
4235, 41mpan2 704 . . . . . . . . . . 11 (⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
4331, 42sylbi 220 . . . . . . . . . 10 (𝑓(Walks‘𝐺)𝑦 → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
4443exlimiv 1962 . . . . . . . . 9 (∃𝑓 𝑓(Walks‘𝐺)𝑦 → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
4530, 44biimtrrdi 257 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → (𝑦 ∈ (WWalks‘𝐺) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥))))
4645imp 412 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
47 df-rex 3087 . . . . . . 7 (∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd ‘𝑥) ↔ ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘𝑥)))
4846, 47sylibr 237 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd ‘𝑥))
4915eqeq2d 2771 . . . . . . 7 (𝑥 ∈ (Walks‘𝐺) → (𝑦 = (𝐹‘𝑥) ↔ 𝑦 = (2nd ‘𝑥)))
5049rexbiia 3107 . . . . . 6 (∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹‘𝑥) ↔ ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd ‘𝑥))
5148, 50sylibr 237 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹‘𝑥))
5251ralrimiva 3154 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → ∀𝑦 ∈ (WWalks‘𝐺)∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹‘𝑥))
53 dffo3 7102 . . . 4 (𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺) ∧ ∀𝑦 ∈ (WWalks‘𝐺)∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹‘𝑥)))
5411, 52, 53sylanbrc 595 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺))
55 df-f1o 6545 . . 3 (𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺) ∧ 𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺)))
5628, 54, 55sylanbrc 595 . 2 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺))
5710, 56mpdan 700 1 (𝐺 ∈ USPGraph → 𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450  ⟨cop 4589   class class class wbr 5102   ↦ cmpt 5185  ⟶wf 6534  –1-1→wf1 6535  –onto→wfo 6536  –1-1-onto→wf1o 6537  ‘cfv 6538  1st c1st 7999  2nd c2nd 8000  USPGraphcuspgr 29729  Walkscwlks 30177  WWalkscwwlks 30414
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1079  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-oadd 8480  df-er 8717  df-map 8849  df-pm 8850  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-dju 9982  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-n0 12607  df-xnn0 12680  df-z 12694  df-uz 12966  df-fz 13640  df-fzo 13789  df-hash 14475  df-word 14659  df-edg 29626  df-uhgr 29636  df-upgr 29660  df-uspgr 29731  df-wlks 30180  df-wwlks 30419
This theorem is used by:  wlkswwlksen  30469  wlknwwlksnbij  30477
  Copyright terms: Public domain W3C validator