Theorem trls 26066

Description: The set of trails (in an undirected graph). (Contributed by Alexander van der Vekens, 20-Oct-2017.)

Assertion

Ref	Expression
trls	⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑉 Trails 𝐸) = {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})})

Distinct variable groups:   𝑓,𝐸,𝑘,𝑝   𝑓,𝑉,𝑝

Allowed substitution hints:   𝑉(𝑘)   𝑋(𝑓,𝑘,𝑝)   𝑌(𝑓,𝑘,𝑝)

Proof of Theorem trls

Dummy variables 𝑒 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3185	. 2 ⊢ (𝑉 ∈ 𝑋 → 𝑉 ∈ V)
2		elex 3185	. 2 ⊢ (𝐸 ∈ 𝑌 → 𝐸 ∈ V)
3		df-trail 26037	. . . 4 ⊢ Trails = (𝑣 ∈ V, 𝑒 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓)})
4	3	a1i 11	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → Trails = (𝑣 ∈ V, 𝑒 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓)}))
5		oveq12 6558	. . . . . . . 8 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑣 Walks 𝑒) = (𝑉 Walks 𝐸))
6	5	breqd 4594	. . . . . . 7 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑓(𝑣 Walks 𝑒)𝑝 ↔ 𝑓(𝑉 Walks 𝐸)𝑝))
7	6	anbi1d 737	. . . . . 6 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → ((𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓) ↔ (𝑓(𝑉 Walks 𝐸)𝑝 ∧ Fun ◡𝑓)))
8	7	adantl 481	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓) ↔ (𝑓(𝑉 Walks 𝐸)𝑝 ∧ Fun ◡𝑓)))
9		iswlkg 26052	. . . . . . . 8 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (𝑓(𝑉 Walks 𝐸)𝑝 ↔ (𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
10	9	adantr 480	. . . . . . 7 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → (𝑓(𝑉 Walks 𝐸)𝑝 ↔ (𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
11	10	anbi1d 737	. . . . . 6 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑓(𝑉 Walks 𝐸)𝑝 ∧ Fun ◡𝑓) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ∧ Fun ◡𝑓)))
12		3anass 1035	. . . . . . 7 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
13		ancom 465	. . . . . . . 8 ⊢ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ↔ (Fun ◡𝑓 ∧ 𝑓 ∈ Word dom 𝐸))
14	13	anbi1i 727	. . . . . . 7 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ↔ ((Fun ◡𝑓 ∧ 𝑓 ∈ Word dom 𝐸) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
15		anass 679	. . . . . . . 8 ⊢ (((Fun ◡𝑓 ∧ 𝑓 ∈ Word dom 𝐸) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ↔ (Fun ◡𝑓 ∧ (𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))))
16		ancom 465	. . . . . . . 8 ⊢ ((Fun ◡𝑓 ∧ (𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ∧ Fun ◡𝑓))
17		3anass 1035	. . . . . . . . . 10 ⊢ ((𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ↔ (𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
18	17	bicomi 213	. . . . . . . . 9 ⊢ ((𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ↔ (𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))
19	18	anbi1i 727	. . . . . . . 8 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ∧ Fun ◡𝑓) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ∧ Fun ◡𝑓))
20	15, 16, 19	3bitri 285	. . . . . . 7 ⊢ (((Fun ◡𝑓 ∧ 𝑓 ∈ Word dom 𝐸) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ∧ Fun ◡𝑓))
21	12, 14, 20	3bitri 285	. . . . . 6 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ∧ Fun ◡𝑓))
22	11, 21	syl6bbr 277	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑓(𝑉 Walks 𝐸)𝑝 ∧ Fun ◡𝑓) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
23	8, 22	bitrd 267	. . . 4 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓) ↔ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))
24	23	opabbidv 4648	. . 3 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑣 Walks 𝑒)𝑝 ∧ Fun ◡𝑓)} = {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})})
25		simpl 472	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → 𝑉 ∈ V)
26		simpr 476	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → 𝐸 ∈ V)
27		anass 679	. . . . . 6 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) ↔ (𝑓 ∈ Word dom 𝐸 ∧ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))))
28	12, 27	bitri 263	. . . . 5 ⊢ (((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) ↔ (𝑓 ∈ Word dom 𝐸 ∧ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))))
29	28	opabbii 4649	. . . 4 ⊢ {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})} = {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐸 ∧ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))}
30		dmexg 6989	. . . . . . 7 ⊢ (𝐸 ∈ V → dom 𝐸 ∈ V)
31	30	adantl 481	. . . . . 6 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → dom 𝐸 ∈ V)
32		wrdexg 13170	. . . . . 6 ⊢ (dom 𝐸 ∈ V → Word dom 𝐸 ∈ V)
33	31, 32	syl 17	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → Word dom 𝐸 ∈ V)
34		fzfi 12633	. . . . . . 7 ⊢ (0...(#‘𝑓)) ∈ Fin
35	25	adantr 480	. . . . . . 7 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑓 ∈ Word dom 𝐸) → 𝑉 ∈ V)
36		mapex 7750	. . . . . . 7 ⊢ (((0...(#‘𝑓)) ∈ Fin ∧ 𝑉 ∈ V) → {𝑝 ∣ 𝑝:(0...(#‘𝑓))⟶𝑉} ∈ V)
37	34, 35, 36	sylancr 694	. . . . . 6 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑓 ∈ Word dom 𝐸) → {𝑝 ∣ 𝑝:(0...(#‘𝑓))⟶𝑉} ∈ V)
38		simpl 472	. . . . . . . . 9 ⊢ ((𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}) → 𝑝:(0...(#‘𝑓))⟶𝑉)
39	38	adantl 481	. . . . . . . 8 ⊢ ((Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})) → 𝑝:(0...(#‘𝑓))⟶𝑉)
40	39	ss2abi 3637	. . . . . . 7 ⊢ {𝑝 ∣ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))} ⊆ {𝑝 ∣ 𝑝:(0...(#‘𝑓))⟶𝑉}
41	40	a1i 11	. . . . . 6 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑓 ∈ Word dom 𝐸) → {𝑝 ∣ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))} ⊆ {𝑝 ∣ 𝑝:(0...(#‘𝑓))⟶𝑉})
42	37, 41	ssexd 4733	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑓 ∈ Word dom 𝐸) → {𝑝 ∣ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))}))} ∈ V)
43	33, 42	opabex3d 7037	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐸 ∧ (Fun ◡𝑓 ∧ (𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})))} ∈ V)
44	29, 43	syl5eqel 2692	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})} ∈ V)
45	4, 24, 25, 26, 44	ovmpt2d 6686	. 2 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (𝑉 Trails 𝐸) = {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})})
46	1, 2, 45	syl2an 493	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (𝑉 Trails 𝐸) = {⟨𝑓, 𝑝⟩ ∣ ((𝑓 ∈ Word dom 𝐸 ∧ Fun ◡𝑓) ∧ 𝑝:(0...(#‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(#‘𝑓))(𝐸‘(𝑓‘𝑘)) = {(𝑝‘𝑘), (𝑝‘(𝑘 + 1))})})

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  {cab 2596  ∀wral 2896  Vcvv 3173   ⊆ wss 3540  {cpr 4127   class class class wbr 4583  {copab 4642  ^◡ccnv 5037  dom cdm 5038  Fun wfun 5798  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  Fincfn 7841  0cc0 9815  1c1 9816   + caddc 9818  ...cfz 12197  ..^cfzo 12334  #chash 12979  Word cword 13146   Walks cwalk 26026   Trails ctrail 26027

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-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-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-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-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-wlk 26036  df-trail 26037

This theorem is referenced by:  istrl  26067