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

Theorem wlkswwlksf1o 28824
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 6855 . . . . . 6 (1st𝑤) ∈ V
2 breq1 5108 . . . . . 6 (𝑓 = (1st𝑤) → (𝑓(Walks‘𝐺)(2nd𝑤) ↔ (1st𝑤)(Walks‘𝐺)(2nd𝑤)))
31, 2spcev 3565 . . . . 5 ((1st𝑤)(Walks‘𝐺)(2nd𝑤) → ∃𝑓 𝑓(Walks‘𝐺)(2nd𝑤))
4 wlkiswwlks 28821 . . . . 5 (𝐺 ∈ USPGraph → (∃𝑓 𝑓(Walks‘𝐺)(2nd𝑤) ↔ (2nd𝑤) ∈ (WWalks‘𝐺)))
53, 4imbitrid 243 . . . 4 (𝐺 ∈ USPGraph → ((1st𝑤)(Walks‘𝐺)(2nd𝑤) → (2nd𝑤) ∈ (WWalks‘𝐺)))
6 wlkcpr 28577 . . . . 5 (𝑤 ∈ (Walks‘𝐺) ↔ (1st𝑤)(Walks‘𝐺)(2nd𝑤))
76biimpi 215 . . . 4 (𝑤 ∈ (Walks‘𝐺) → (1st𝑤)(Walks‘𝐺)(2nd𝑤))
85, 7impel 506 . . 3 ((𝐺 ∈ USPGraph ∧ 𝑤 ∈ (Walks‘𝐺)) → (2nd𝑤) ∈ (WWalks‘𝐺))
9 wlkswwlksf1o.f . . 3 𝐹 = (𝑤 ∈ (Walks‘𝐺) ↦ (2nd𝑤))
108, 9fmptd 7062 . 2 (𝐺 ∈ USPGraph → 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺))
11 simpr 485 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺))
12 fveq2 6842 . . . . . . . . 9 (𝑤 = 𝑥 → (2nd𝑤) = (2nd𝑥))
13 id 22 . . . . . . . . 9 (𝑥 ∈ (Walks‘𝐺) → 𝑥 ∈ (Walks‘𝐺))
14 fvexd 6857 . . . . . . . . 9 (𝑥 ∈ (Walks‘𝐺) → (2nd𝑥) ∈ V)
159, 12, 13, 14fvmptd3 6971 . . . . . . . 8 (𝑥 ∈ (Walks‘𝐺) → (𝐹𝑥) = (2nd𝑥))
16 fveq2 6842 . . . . . . . . 9 (𝑤 = 𝑦 → (2nd𝑤) = (2nd𝑦))
17 id 22 . . . . . . . . 9 (𝑦 ∈ (Walks‘𝐺) → 𝑦 ∈ (Walks‘𝐺))
18 fvexd 6857 . . . . . . . . 9 (𝑦 ∈ (Walks‘𝐺) → (2nd𝑦) ∈ V)
199, 16, 17, 18fvmptd3 6971 . . . . . . . 8 (𝑦 ∈ (Walks‘𝐺) → (𝐹𝑦) = (2nd𝑦))
2015, 19eqeqan12d 2750 . . . . . . 7 ((𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) → ((𝐹𝑥) = (𝐹𝑦) ↔ (2nd𝑥) = (2nd𝑦)))
2120adantl 482 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((𝐹𝑥) = (𝐹𝑦) ↔ (2nd𝑥) = (2nd𝑦)))
22 uspgr2wlkeqi 28596 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) ∧ (2nd𝑥) = (2nd𝑦)) → 𝑥 = 𝑦)
2322ad4ant134 1174 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) ∧ (2nd𝑥) = (2nd𝑦)) → 𝑥 = 𝑦)
2423ex 413 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((2nd𝑥) = (2nd𝑦) → 𝑥 = 𝑦))
2521, 24sylbid 239 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺))) → ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦))
2625ralrimivva 3197 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → ∀𝑥 ∈ (Walks‘𝐺)∀𝑦 ∈ (Walks‘𝐺)((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦))
27 dff13 7202 . . . 4 (𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺) ∧ ∀𝑥 ∈ (Walks‘𝐺)∀𝑦 ∈ (Walks‘𝐺)((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
2811, 26, 27sylanbrc 583 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺))
29 wlkiswwlks 28821 . . . . . . . . . 10 (𝐺 ∈ USPGraph → (∃𝑓 𝑓(Walks‘𝐺)𝑦𝑦 ∈ (WWalks‘𝐺)))
3029adantr 481 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → (∃𝑓 𝑓(Walks‘𝐺)𝑦𝑦 ∈ (WWalks‘𝐺)))
31 df-br 5106 . . . . . . . . . . 11 (𝑓(Walks‘𝐺)𝑦 ↔ ⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺))
32 vex 3449 . . . . . . . . . . . . . 14 𝑓 ∈ V
33 vex 3449 . . . . . . . . . . . . . 14 𝑦 ∈ V
3432, 33op2nd 7930 . . . . . . . . . . . . 13 (2nd ‘⟨𝑓, 𝑦⟩) = 𝑦
3534eqcomi 2745 . . . . . . . . . . . 12 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)
36 opex 5421 . . . . . . . . . . . . 13 𝑓, 𝑦⟩ ∈ V
37 eleq1 2825 . . . . . . . . . . . . . 14 (𝑥 = ⟨𝑓, 𝑦⟩ → (𝑥 ∈ (Walks‘𝐺) ↔ ⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺)))
38 fveq2 6842 . . . . . . . . . . . . . . 15 (𝑥 = ⟨𝑓, 𝑦⟩ → (2nd𝑥) = (2nd ‘⟨𝑓, 𝑦⟩))
3938eqeq2d 2747 . . . . . . . . . . . . . 14 (𝑥 = ⟨𝑓, 𝑦⟩ → (𝑦 = (2nd𝑥) ↔ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)))
4037, 39anbi12d 631 . . . . . . . . . . . . 13 (𝑥 = ⟨𝑓, 𝑦⟩ → ((𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)) ↔ (⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩))))
4136, 40spcev 3565 . . . . . . . . . . . 12 ((⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd ‘⟨𝑓, 𝑦⟩)) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
4235, 41mpan2 689 . . . . . . . . . . 11 (⟨𝑓, 𝑦⟩ ∈ (Walks‘𝐺) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
4331, 42sylbi 216 . . . . . . . . . 10 (𝑓(Walks‘𝐺)𝑦 → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
4443exlimiv 1933 . . . . . . . . 9 (∃𝑓 𝑓(Walks‘𝐺)𝑦 → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
4530, 44syl6bir 253 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → (𝑦 ∈ (WWalks‘𝐺) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥))))
4645imp 407 . . . . . . 7 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
47 df-rex 3074 . . . . . . 7 (∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd𝑥) ↔ ∃𝑥(𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 = (2nd𝑥)))
4846, 47sylibr 233 . . . . . 6 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd𝑥))
4915eqeq2d 2747 . . . . . . 7 (𝑥 ∈ (Walks‘𝐺) → (𝑦 = (𝐹𝑥) ↔ 𝑦 = (2nd𝑥)))
5049rexbiia 3095 . . . . . 6 (∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹𝑥) ↔ ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (2nd𝑥))
5148, 50sylibr 233 . . . . 5 (((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) ∧ 𝑦 ∈ (WWalks‘𝐺)) → ∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹𝑥))
5251ralrimiva 3143 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → ∀𝑦 ∈ (WWalks‘𝐺)∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹𝑥))
53 dffo3 7052 . . . 4 (𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺) ∧ ∀𝑦 ∈ (WWalks‘𝐺)∃𝑥 ∈ (Walks‘𝐺)𝑦 = (𝐹𝑥)))
5411, 52, 53sylanbrc 583 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺))
55 df-f1o 6503 . . 3 (𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺) ↔ (𝐹:(Walks‘𝐺)–1-1→(WWalks‘𝐺) ∧ 𝐹:(Walks‘𝐺)–onto→(WWalks‘𝐺)))
5628, 54, 55sylanbrc 583 . 2 ((𝐺 ∈ USPGraph ∧ 𝐹:(Walks‘𝐺)⟶(WWalks‘𝐺)) → 𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺))
5710, 56mpdan 685 1 (𝐺 ∈ USPGraph → 𝐹:(Walks‘𝐺)–1-1-onto→(WWalks‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  wral 3064  wrex 3073  Vcvv 3445  cop 4592   class class class wbr 5105  cmpt 5188  wf 6492  1-1wf1 6493  ontowfo 6494  1-1-ontowf1o 6495  cfv 6496  1st c1st 7919  2nd c2nd 7920  USPGraphcuspgr 28099  Walkscwlks 28544  WWalkscwwlks 28770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-ifp 1062  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-2o 8413  df-oadd 8416  df-er 8648  df-map 8767  df-pm 8768  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-dju 9837  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-n0 12414  df-xnn0 12486  df-z 12500  df-uz 12764  df-fz 13425  df-fzo 13568  df-hash 14231  df-word 14403  df-edg 27999  df-uhgr 28009  df-upgr 28033  df-uspgr 28101  df-wlks 28547  df-wwlks 28775
This theorem is referenced by:  wlkswwlksen  28825  wlknwwlksnbij  28833
  Copyright terms: Public domain W3C validator