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

Theorem upgriswlk 27594
Description: Properties of a pair of functions to be a walk in a pseudograph. (Contributed by AV, 2-Jan-2021.) (Revised by AV, 28-Oct-2021.)
Hypotheses
Ref Expression
upgriswlk.v 𝑉 = (Vtx‘𝐺)
upgriswlk.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
upgriswlk (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
Distinct variable groups:   𝑘,𝐺   𝑘,𝐹   𝑘,𝐼   𝑃,𝑘   𝑘,𝑉

Proof of Theorem upgriswlk
StepHypRef Expression
1 upgriswlk.v . . 3 𝑉 = (Vtx‘𝐺)
2 upgriswlk.i . . 3 𝐼 = (iEdg‘𝐺)
31, 2iswlkg 27567 . 2 (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
4 df-ifp 1063 . . . . . . 7 (if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) ↔ (((𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}) ∨ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))))
5 dfsn2 4539 . . . . . . . . . . . . 13 {(𝑃𝑘)} = {(𝑃𝑘), (𝑃𝑘)}
6 preq2 4635 . . . . . . . . . . . . 13 ((𝑃𝑘) = (𝑃‘(𝑘 + 1)) → {(𝑃𝑘), (𝑃𝑘)} = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
75, 6syl5eq 2786 . . . . . . . . . . . 12 ((𝑃𝑘) = (𝑃‘(𝑘 + 1)) → {(𝑃𝑘)} = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
87eqeq2d 2750 . . . . . . . . . . 11 ((𝑃𝑘) = (𝑃‘(𝑘 + 1)) → ((𝐼‘(𝐹𝑘)) = {(𝑃𝑘)} ↔ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
98biimpa 480 . . . . . . . . . 10 (((𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
109a1d 25 . . . . . . . . 9 (((𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}) → (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
11 eqid 2739 . . . . . . . . . . . . . 14 (Edg‘𝐺) = (Edg‘𝐺)
122, 11upgredginwlk 27589 . . . . . . . . . . . . 13 ((𝐺 ∈ UPGraph ∧ 𝐹 ∈ Word dom 𝐼) → (𝑘 ∈ (0..^(♯‘𝐹)) → (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)))
1312adantrr 717 . . . . . . . . . . . 12 ((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) → (𝑘 ∈ (0..^(♯‘𝐹)) → (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)))
1413imp 410 . . . . . . . . . . 11 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺))
15 simp-4l 783 . . . . . . . . . . . . . 14 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → 𝐺 ∈ UPGraph)
16 simpr 488 . . . . . . . . . . . . . . 15 ((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) → (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺))
1716adantr 484 . . . . . . . . . . . . . 14 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺))
18 simpr 488 . . . . . . . . . . . . . . 15 ((¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))
1918adantl 485 . . . . . . . . . . . . . 14 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))
20 fvexd 6701 . . . . . . . . . . . . . . . . 17 (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) → (𝑃𝑘) ∈ V)
21 fvexd 6701 . . . . . . . . . . . . . . . . 17 (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) → (𝑃‘(𝑘 + 1)) ∈ V)
22 neqne 2943 . . . . . . . . . . . . . . . . 17 (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) → (𝑃𝑘) ≠ (𝑃‘(𝑘 + 1)))
2320, 21, 223jca 1129 . . . . . . . . . . . . . . . 16 (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) → ((𝑃𝑘) ∈ V ∧ (𝑃‘(𝑘 + 1)) ∈ V ∧ (𝑃𝑘) ≠ (𝑃‘(𝑘 + 1))))
2423adantr 484 . . . . . . . . . . . . . . 15 ((¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → ((𝑃𝑘) ∈ V ∧ (𝑃‘(𝑘 + 1)) ∈ V ∧ (𝑃𝑘) ≠ (𝑃‘(𝑘 + 1))))
2524adantl 485 . . . . . . . . . . . . . 14 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → ((𝑃𝑘) ∈ V ∧ (𝑃‘(𝑘 + 1)) ∈ V ∧ (𝑃𝑘) ≠ (𝑃‘(𝑘 + 1))))
261, 11upgredgpr 27099 . . . . . . . . . . . . . 14 (((𝐺 ∈ UPGraph ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) ∧ ((𝑃𝑘) ∈ V ∧ (𝑃‘(𝑘 + 1)) ∈ V ∧ (𝑃𝑘) ≠ (𝑃‘(𝑘 + 1)))) → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} = (𝐼‘(𝐹𝑘)))
2715, 17, 19, 25, 26syl31anc 1374 . . . . . . . . . . . . 13 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} = (𝐼‘(𝐹𝑘)))
2827eqcomd 2745 . . . . . . . . . . . 12 (((((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) ∧ (𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺)) ∧ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
2928exp31 423 . . . . . . . . . . 11 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → ((𝐼‘(𝐹𝑘)) ∈ (Edg‘𝐺) → ((¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
3014, 29mpd 15 . . . . . . . . . 10 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → ((¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
3130com12 32 . . . . . . . . 9 ((¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
3210, 31jaoi 856 . . . . . . . 8 ((((𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}) ∨ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
3332com12 32 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → ((((𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}) ∨ (¬ (𝑃𝑘) = (𝑃‘(𝑘 + 1)) ∧ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
344, 33syl5bi 245 . . . . . 6 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) → (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
35 ifpprsnss 4665 . . . . . 6 ((𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} → if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))
3634, 35impbid1 228 . . . . 5 (((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) ↔ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
3736ralbidva 3109 . . . 4 ((𝐺 ∈ UPGraph ∧ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉)) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))) ↔ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
3837pm5.32da 582 . . 3 (𝐺 ∈ UPGraph → (((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) ↔ ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
39 df-3an 1090 . . 3 ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) ↔ ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))))
40 df-3an 1090 . . 3 ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) ↔ ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
4138, 39, 403bitr4g 317 . 2 (𝐺 ∈ UPGraph → ((𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))) ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
423, 41bitrd 282 1 (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wo 846  if-wif 1062  w3a 1088   = wceq 1542  wcel 2114  wne 2935  wral 3054  Vcvv 3400  wss 3853  {csn 4526  {cpr 4528   class class class wbr 5040  dom cdm 5535  wf 6345  cfv 6349  (class class class)co 7182  0cc0 10627  1c1 10628   + caddc 10630  ...cfz 12993  ..^cfzo 13136  chash 13794  Word cword 13967  Vtxcvtx 26953  iEdgciedg 26954  Edgcedg 27004  UPGraphcupgr 27037  Walkscwlks 27550
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5242  ax-pr 5306  ax-un 7491  ax-cnex 10683  ax-resscn 10684  ax-1cn 10685  ax-icn 10686  ax-addcl 10687  ax-addrcl 10688  ax-mulcl 10689  ax-mulrcl 10690  ax-mulcom 10691  ax-addass 10692  ax-mulass 10693  ax-distr 10694  ax-i2m1 10695  ax-1ne0 10696  ax-1rid 10697  ax-rnegex 10698  ax-rrecex 10699  ax-cnre 10700  ax-pre-lttri 10701  ax-pre-lttrn 10702  ax-pre-ltadd 10703  ax-pre-mulgt0 10704
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-ifp 1063  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-nel 3040  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3402  df-sbc 3686  df-csb 3801  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4222  df-if 4425  df-pw 4500  df-sn 4527  df-pr 4529  df-tp 4531  df-op 4533  df-uni 4807  df-int 4847  df-iun 4893  df-br 5041  df-opab 5103  df-mpt 5121  df-tr 5147  df-id 5439  df-eprel 5444  df-po 5452  df-so 5453  df-fr 5493  df-we 5495  df-xp 5541  df-rel 5542  df-cnv 5543  df-co 5544  df-dm 5545  df-rn 5546  df-res 5547  df-ima 5548  df-pred 6139  df-ord 6185  df-on 6186  df-lim 6187  df-suc 6188  df-iota 6307  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7139  df-ov 7185  df-oprab 7186  df-mpo 7187  df-om 7612  df-1st 7726  df-2nd 7727  df-wrecs 7988  df-recs 8049  df-rdg 8087  df-1o 8143  df-2o 8144  df-oadd 8147  df-er 8332  df-map 8451  df-pm 8452  df-en 8568  df-dom 8569  df-sdom 8570  df-fin 8571  df-dju 9415  df-card 9453  df-pnf 10767  df-mnf 10768  df-xr 10769  df-ltxr 10770  df-le 10771  df-sub 10962  df-neg 10963  df-nn 11729  df-2 11791  df-n0 11989  df-xnn0 12061  df-z 12075  df-uz 12337  df-fz 12994  df-fzo 13137  df-hash 13795  df-word 13968  df-edg 27005  df-uhgr 27015  df-upgr 27039  df-wlks 27553
This theorem is referenced by:  upgrwlkedg  27595  upgrwlkcompim  27596  upgrwlkvtxedg  27598  upgr2wlk  27622  upgrtrls  27655  upgristrl  27656  upgrwlkdvde  27690  usgr2wlkneq  27709  isclwlkupgr  27731  uspgrn2crct  27758  wlkiswwlks1  27817  wlkiswwlks2  27825  wlkiswwlksupgr2  27827  wlk2v2e  28106  upgriseupth  28156
  Copyright terms: Public domain W3C validator