Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wlkwwlksur Structured version   Visualization version   GIF version

Theorem wlkwwlksur 41094
 Description: Lemma 3 for wlkwwlkbij2 41096. (Contributed by Alexander van der Vekens, 23-Jul-2018.) (Revised by AV, 16-Apr-2021.)
Hypotheses
Ref Expression
wlkwwlkbij.t 𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}
wlkwwlkbij.w 𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}
wlkwwlkbij.f 𝐹 = (𝑡𝑇 ↦ (2nd𝑡))
Assertion
Ref Expression
wlkwwlksur ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
Distinct variable groups:   𝐺,𝑝,𝑡,𝑤   𝑁,𝑝,𝑡,𝑤   𝑃,𝑝,𝑡,𝑤   𝑡,𝑇,𝑤   𝑡,𝑉   𝑡,𝑊   𝑤,𝐹   𝑤,𝑉   𝐹,𝑝   𝑇,𝑝   𝑊,𝑝
Allowed substitution hints:   𝐹(𝑡)   𝑉(𝑝)   𝑊(𝑤)

Proof of Theorem wlkwwlksur
Dummy variables 𝑢 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uspgrupgr 40406 . . 3 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph )
2 wlkwwlkbij.t . . . 4 𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}
3 wlkwwlkbij.w . . . 4 𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}
4 wlkwwlkbij.f . . . 4 𝐹 = (𝑡𝑇 ↦ (2nd𝑡))
52, 3, 4wlkwwlkfun 41092 . . 3 ((𝐺 ∈ UPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇𝑊)
61, 5syl3an1 1351 . 2 ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇𝑊)
7 fveq1 6102 . . . . . . 7 (𝑤 = 𝑝 → (𝑤‘0) = (𝑝‘0))
87eqeq1d 2612 . . . . . 6 (𝑤 = 𝑝 → ((𝑤‘0) = 𝑃 ↔ (𝑝‘0) = 𝑃))
98, 3elrab2 3333 . . . . 5 (𝑝𝑊 ↔ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃))
10 1wlklnwwlkn 41081 . . . . . . . . . . 11 (𝐺 ∈ USPGraph → (∃𝑓(𝑓(1Walks‘𝐺)𝑝 ∧ (#‘𝑓) = 𝑁) ↔ 𝑝 ∈ (𝑁 WWalkSN 𝐺)))
11 df-br 4584 . . . . . . . . . . . . 13 (𝑓(1Walks‘𝐺)𝑝 ↔ ⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺))
12 vex 3176 . . . . . . . . . . . . . . . . 17 𝑓 ∈ V
13 vex 3176 . . . . . . . . . . . . . . . . 17 𝑝 ∈ V
1412, 13op1st 7067 . . . . . . . . . . . . . . . 16 (1st ‘⟨𝑓, 𝑝⟩) = 𝑓
1514eqcomi 2619 . . . . . . . . . . . . . . 15 𝑓 = (1st ‘⟨𝑓, 𝑝⟩)
1615fveq2i 6106 . . . . . . . . . . . . . 14 (#‘𝑓) = (#‘(1st ‘⟨𝑓, 𝑝⟩))
1716eqeq1i 2615 . . . . . . . . . . . . 13 ((#‘𝑓) = 𝑁 ↔ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁)
1812, 13op2nd 7068 . . . . . . . . . . . . . . . . 17 (2nd ‘⟨𝑓, 𝑝⟩) = 𝑝
1918eqcomi 2619 . . . . . . . . . . . . . . . 16 𝑝 = (2nd ‘⟨𝑓, 𝑝⟩)
2019fveq1i 6104 . . . . . . . . . . . . . . 15 (𝑝‘0) = ((2nd ‘⟨𝑓, 𝑝⟩)‘0)
2120eqeq1i 2615 . . . . . . . . . . . . . 14 ((𝑝‘0) = 𝑃 ↔ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃)
22 opex 4859 . . . . . . . . . . . . . . . 16 𝑓, 𝑝⟩ ∈ V
2322a1i 11 . . . . . . . . . . . . . . 15 ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) → ⟨𝑓, 𝑝⟩ ∈ V)
24 simpll 786 . . . . . . . . . . . . . . . . . 18 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃) → ⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺))
25 simpr 476 . . . . . . . . . . . . . . . . . . 19 ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) → (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁)
2625anim1i 590 . . . . . . . . . . . . . . . . . 18 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃) → ((#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁 ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃))
2719a1i 11 . . . . . . . . . . . . . . . . . 18 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃) → 𝑝 = (2nd ‘⟨𝑓, 𝑝⟩))
2824, 26, 27jca31 555 . . . . . . . . . . . . . . . . 17 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃) → ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ ((#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁 ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃)) ∧ 𝑝 = (2nd ‘⟨𝑓, 𝑝⟩)))
29 eleq1 2676 . . . . . . . . . . . . . . . . . . 19 (𝑢 = ⟨𝑓, 𝑝⟩ → (𝑢 ∈ (1Walks‘𝐺) ↔ ⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺)))
30 fveq2 6103 . . . . . . . . . . . . . . . . . . . . . 22 (𝑢 = ⟨𝑓, 𝑝⟩ → (1st𝑢) = (1st ‘⟨𝑓, 𝑝⟩))
3130fveq2d 6107 . . . . . . . . . . . . . . . . . . . . 21 (𝑢 = ⟨𝑓, 𝑝⟩ → (#‘(1st𝑢)) = (#‘(1st ‘⟨𝑓, 𝑝⟩)))
3231eqeq1d 2612 . . . . . . . . . . . . . . . . . . . 20 (𝑢 = ⟨𝑓, 𝑝⟩ → ((#‘(1st𝑢)) = 𝑁 ↔ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁))
33 fveq2 6103 . . . . . . . . . . . . . . . . . . . . . 22 (𝑢 = ⟨𝑓, 𝑝⟩ → (2nd𝑢) = (2nd ‘⟨𝑓, 𝑝⟩))
3433fveq1d 6105 . . . . . . . . . . . . . . . . . . . . 21 (𝑢 = ⟨𝑓, 𝑝⟩ → ((2nd𝑢)‘0) = ((2nd ‘⟨𝑓, 𝑝⟩)‘0))
3534eqeq1d 2612 . . . . . . . . . . . . . . . . . . . 20 (𝑢 = ⟨𝑓, 𝑝⟩ → (((2nd𝑢)‘0) = 𝑃 ↔ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃))
3632, 35anbi12d 743 . . . . . . . . . . . . . . . . . . 19 (𝑢 = ⟨𝑓, 𝑝⟩ → (((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃) ↔ ((#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁 ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃)))
3729, 36anbi12d 743 . . . . . . . . . . . . . . . . . 18 (𝑢 = ⟨𝑓, 𝑝⟩ → ((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ↔ (⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ ((#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁 ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃))))
3833eqeq2d 2620 . . . . . . . . . . . . . . . . . 18 (𝑢 = ⟨𝑓, 𝑝⟩ → (𝑝 = (2nd𝑢) ↔ 𝑝 = (2nd ‘⟨𝑓, 𝑝⟩)))
3937, 38anbi12d 743 . . . . . . . . . . . . . . . . 17 (𝑢 = ⟨𝑓, 𝑝⟩ → (((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢)) ↔ ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ ((#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁 ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃)) ∧ 𝑝 = (2nd ‘⟨𝑓, 𝑝⟩))))
4028, 39syl5ibrcom 236 . . . . . . . . . . . . . . . 16 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ ((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃) → (𝑢 = ⟨𝑓, 𝑝⟩ → ((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4140impancom 455 . . . . . . . . . . . . . . 15 (((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) ∧ 𝑢 = ⟨𝑓, 𝑝⟩) → (((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃 → ((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4223, 41spcimedv 3265 . . . . . . . . . . . . . 14 ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) → (((2nd ‘⟨𝑓, 𝑝⟩)‘0) = 𝑃 → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4321, 42syl5bi 231 . . . . . . . . . . . . 13 ((⟨𝑓, 𝑝⟩ ∈ (1Walks‘𝐺) ∧ (#‘(1st ‘⟨𝑓, 𝑝⟩)) = 𝑁) → ((𝑝‘0) = 𝑃 → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4411, 17, 43syl2anb 495 . . . . . . . . . . . 12 ((𝑓(1Walks‘𝐺)𝑝 ∧ (#‘𝑓) = 𝑁) → ((𝑝‘0) = 𝑃 → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4544exlimiv 1845 . . . . . . . . . . 11 (∃𝑓(𝑓(1Walks‘𝐺)𝑝 ∧ (#‘𝑓) = 𝑁) → ((𝑝‘0) = 𝑃 → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢))))
4610, 45syl6bir 243 . . . . . . . . . 10 (𝐺 ∈ USPGraph → (𝑝 ∈ (𝑁 WWalkSN 𝐺) → ((𝑝‘0) = 𝑃 → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢)))))
4746imp32 448 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃)) → ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢)))
48 fveq2 6103 . . . . . . . . . . . . . . 15 (𝑝 = 𝑢 → (1st𝑝) = (1st𝑢))
4948fveq2d 6107 . . . . . . . . . . . . . 14 (𝑝 = 𝑢 → (#‘(1st𝑝)) = (#‘(1st𝑢)))
5049eqeq1d 2612 . . . . . . . . . . . . 13 (𝑝 = 𝑢 → ((#‘(1st𝑝)) = 𝑁 ↔ (#‘(1st𝑢)) = 𝑁))
51 fveq2 6103 . . . . . . . . . . . . . . 15 (𝑝 = 𝑢 → (2nd𝑝) = (2nd𝑢))
5251fveq1d 6105 . . . . . . . . . . . . . 14 (𝑝 = 𝑢 → ((2nd𝑝)‘0) = ((2nd𝑢)‘0))
5352eqeq1d 2612 . . . . . . . . . . . . 13 (𝑝 = 𝑢 → (((2nd𝑝)‘0) = 𝑃 ↔ ((2nd𝑢)‘0) = 𝑃))
5450, 53anbi12d 743 . . . . . . . . . . . 12 (𝑝 = 𝑢 → (((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃) ↔ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)))
5554elrab 3331 . . . . . . . . . . 11 (𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)} ↔ (𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)))
5655anbi1i 727 . . . . . . . . . 10 ((𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)} ∧ 𝑝 = (2nd𝑢)) ↔ ((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢)))
5756exbii 1764 . . . . . . . . 9 (∃𝑢(𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)} ∧ 𝑝 = (2nd𝑢)) ↔ ∃𝑢((𝑢 ∈ (1Walks‘𝐺) ∧ ((#‘(1st𝑢)) = 𝑁 ∧ ((2nd𝑢)‘0) = 𝑃)) ∧ 𝑝 = (2nd𝑢)))
5847, 57sylibr 223 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃)) → ∃𝑢(𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)} ∧ 𝑝 = (2nd𝑢)))
59 df-rex 2902 . . . . . . . 8 (∃𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}𝑝 = (2nd𝑢) ↔ ∃𝑢(𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)} ∧ 𝑝 = (2nd𝑢)))
6058, 59sylibr 223 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃)) → ∃𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}𝑝 = (2nd𝑢))
612rexeqi 3120 . . . . . . 7 (∃𝑢𝑇 𝑝 = (2nd𝑢) ↔ ∃𝑢 ∈ {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}𝑝 = (2nd𝑢))
6260, 61sylibr 223 . . . . . 6 ((𝐺 ∈ USPGraph ∧ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃)) → ∃𝑢𝑇 𝑝 = (2nd𝑢))
63 fveq2 6103 . . . . . . . . 9 (𝑡 = 𝑢 → (2nd𝑡) = (2nd𝑢))
64 fvex 6113 . . . . . . . . 9 (2nd𝑢) ∈ V
6563, 4, 64fvmpt 6191 . . . . . . . 8 (𝑢𝑇 → (𝐹𝑢) = (2nd𝑢))
6665eqeq2d 2620 . . . . . . 7 (𝑢𝑇 → (𝑝 = (𝐹𝑢) ↔ 𝑝 = (2nd𝑢)))
6766rexbiia 3022 . . . . . 6 (∃𝑢𝑇 𝑝 = (𝐹𝑢) ↔ ∃𝑢𝑇 𝑝 = (2nd𝑢))
6862, 67sylibr 223 . . . . 5 ((𝐺 ∈ USPGraph ∧ (𝑝 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑝‘0) = 𝑃)) → ∃𝑢𝑇 𝑝 = (𝐹𝑢))
699, 68sylan2b 491 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝑝𝑊) → ∃𝑢𝑇 𝑝 = (𝐹𝑢))
7069ralrimiva 2949 . . 3 (𝐺 ∈ USPGraph → ∀𝑝𝑊𝑢𝑇 𝑝 = (𝐹𝑢))
71703ad2ant1 1075 . 2 ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → ∀𝑝𝑊𝑢𝑇 𝑝 = (𝐹𝑢))
72 dffo3 6282 . 2 (𝐹:𝑇onto𝑊 ↔ (𝐹:𝑇𝑊 ∧ ∀𝑝𝑊𝑢𝑇 𝑝 = (𝐹𝑢)))
736, 71, 72sylanbrc 695 1 ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475  ∃wex 1695   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  {crab 2900  Vcvv 3173  ⟨cop 4131   class class class wbr 4583   ↦ cmpt 4643  ⟶wf 5800  –onto→wfo 5802  ‘cfv 5804  (class class class)co 6549  1st c1st 7057  2nd c2nd 7058  0cc0 9815  ℕ0cn0 11169  #chash 12979   UPGraph cupgr 25747   USPGraph cuspgr 40378  1Walksc1wlks 40796   WWalkSN cwwlksn 41029 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ifp 1007  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-uhgr 25724  df-upgr 25749  df-edga 25793  df-uspgr 40380  df-1wlks 40800  df-wlks 40801  df-wwlks 41033  df-wwlksn 41034 This theorem is referenced by:  wlkwwlkbij  41095
 Copyright terms: Public domain W3C validator