Theorem frgrncvvdeqlem8 29250

Description: Lemma 8 for frgrncvvdeq 29253. This corresponds to statement 2 in [Huneke] p. 1: "The map is one-to-one since z in N(x) is uniquely determined as the common neighbor of x and a(x)". (Contributed by Alexander van der Vekens, 23-Dec-2017.) (Revised by AV, 10-May-2021.) (Revised by AV, 30-Dec-2021.)

Hypotheses

Ref	Expression
frgrncvvdeq.v1	⊢ 𝑉 = (Vtx‘𝐺)
frgrncvvdeq.e	⊢ 𝐸 = (Edg‘𝐺)
frgrncvvdeq.nx	⊢ 𝐷 = (𝐺 NeighbVtx 𝑋)
frgrncvvdeq.ny	⊢ 𝑁 = (𝐺 NeighbVtx 𝑌)
frgrncvvdeq.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
frgrncvvdeq.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
frgrncvvdeq.ne	⊢ (𝜑 → 𝑋 ≠ 𝑌)
frgrncvvdeq.xy	⊢ (𝜑 → 𝑌 ∉ 𝐷)
frgrncvvdeq.f	⊢ (𝜑 → 𝐺 ∈ FriendGraph )
frgrncvvdeq.a	⊢ 𝐴 = (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸))

Assertion

Ref	Expression
frgrncvvdeqlem8	⊢ (𝜑 → 𝐴:𝐷–1-1→𝑁)

Distinct variable groups:   𝑦,𝐸   𝑦,𝐺   𝑦,𝑉   𝑦,𝑌   𝑥,𝑦,𝑁   𝑥,𝐷   𝑥,𝑁   𝜑,𝑥   𝑦,𝐷   𝑥,𝐸

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑥,𝑦)   𝐺(𝑥)   𝑉(𝑥)   𝑋(𝑥,𝑦)   𝑌(𝑥)

Proof of Theorem frgrncvvdeqlem8

Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frgrncvvdeq.v1	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		frgrncvvdeq.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
3		frgrncvvdeq.nx	. . 3 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋)
4		frgrncvvdeq.ny	. . 3 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌)
5		frgrncvvdeq.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
6		frgrncvvdeq.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
7		frgrncvvdeq.ne	. . 3 ⊢ (𝜑 → 𝑋 ≠ 𝑌)
8		frgrncvvdeq.xy	. . 3 ⊢ (𝜑 → 𝑌 ∉ 𝐷)
9		frgrncvvdeq.f	. . 3 ⊢ (𝜑 → 𝐺 ∈ FriendGraph )
10		frgrncvvdeq.a	. . 3 ⊢ 𝐴 = (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	frgrncvvdeqlem4 29246	. 2 ⊢ (𝜑 → 𝐴:𝐷⟶𝑁)
12		simpr 485	. . 3 ⊢ ((𝜑 ∧ 𝐴:𝐷⟶𝑁) → 𝐴:𝐷⟶𝑁)
13		ffvelcdm 7032	. . . . . . . . 9 ⊢ ((𝐴:𝐷⟶𝑁 ∧ 𝑢 ∈ 𝐷) → (𝐴‘𝑢) ∈ 𝑁)
14	13	ad2ant2lr 746	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (𝐴‘𝑢) ∈ 𝑁)
15	14	adantr 481	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ (𝐴‘𝑢) = (𝐴‘𝑤)) → (𝐴‘𝑢) ∈ 𝑁)
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	frgrncvvdeqlem1 29243	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∉ 𝑁)
17		preq1 4694	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑢 → {𝑥, 𝑦} = {𝑢, 𝑦})
18	17	eleq1d 2822	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑢 → ({𝑥, 𝑦} ∈ 𝐸 ↔ {𝑢, 𝑦} ∈ 𝐸))
19	18	riotabidv 7315	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑢 → (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸) = (℩𝑦 ∈ 𝑁 {𝑢, 𝑦} ∈ 𝐸))
20	19	cbvmptv 5218	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) = (𝑢 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑢, 𝑦} ∈ 𝐸))
21	10, 20	eqtri 2764	. . . . . . . . . . . . . . . . 17 ⊢ 𝐴 = (𝑢 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑢, 𝑦} ∈ 𝐸))
22	1, 2, 3, 4, 5, 6, 7, 8, 9, 21	frgrncvvdeqlem6 29248	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐷) → {𝑢, (𝐴‘𝑢)} ∈ 𝐸)
23		preq1 4694	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑤 → {𝑥, 𝑦} = {𝑤, 𝑦})
24	23	eleq1d 2822	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑤 → ({𝑥, 𝑦} ∈ 𝐸 ↔ {𝑤, 𝑦} ∈ 𝐸))
25	24	riotabidv 7315	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑤 → (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸) = (℩𝑦 ∈ 𝑁 {𝑤, 𝑦} ∈ 𝐸))
26	25	cbvmptv 5218	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) = (𝑤 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑤, 𝑦} ∈ 𝐸))
27	10, 26	eqtri 2764	. . . . . . . . . . . . . . . . 17 ⊢ 𝐴 = (𝑤 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑤, 𝑦} ∈ 𝐸))
28	1, 2, 3, 4, 5, 6, 7, 8, 9, 27	frgrncvvdeqlem6 29248	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → {𝑤, (𝐴‘𝑤)} ∈ 𝐸)
29	22, 28	anim12dan 619	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸))
30		preq2 4695	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐴‘𝑤) = (𝐴‘𝑢) → {𝑤, (𝐴‘𝑤)} = {𝑤, (𝐴‘𝑢)})
31	30	eleq1d 2822	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐴‘𝑤) = (𝐴‘𝑢) → ({𝑤, (𝐴‘𝑤)} ∈ 𝐸 ↔ {𝑤, (𝐴‘𝑢)} ∈ 𝐸))
32	31	anbi2d 629	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴‘𝑤) = (𝐴‘𝑢) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸) ↔ ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸)))
33	32	eqcoms 2744	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴‘𝑢) = (𝐴‘𝑤) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸) ↔ ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸)))
34	33	biimpa 477	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴‘𝑢) = (𝐴‘𝑤) ∧ ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸)) → ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸))
35		df-ne 2944	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ≠ 𝑤 ↔ ¬ 𝑢 = 𝑤)
36	2, 3	frgrnbnb 29237	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 ≠ 𝑤) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → (𝐴‘𝑢) = 𝑋))
37	9, 36	syl3an1 1163	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 ≠ 𝑤) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → (𝐴‘𝑢) = 𝑋))
38	37	3expa 1118	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ 𝑢 ≠ 𝑤) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → (𝐴‘𝑢) = 𝑋))
39		df-nel 3050	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ 𝑁)
40		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐴‘𝑢) = 𝑋 → ((𝐴‘𝑢) ∈ 𝑁 ↔ 𝑋 ∈ 𝑁))
41	40	biimpa 477	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐴‘𝑢) = 𝑋 ∧ (𝐴‘𝑢) ∈ 𝑁) → 𝑋 ∈ 𝑁)
42	41	pm2.24d 151	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝐴‘𝑢) = 𝑋 ∧ (𝐴‘𝑢) ∈ 𝑁) → (¬ 𝑋 ∈ 𝑁 → 𝑢 = 𝑤))
43	42	expcom 414	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐴‘𝑢) ∈ 𝑁 → ((𝐴‘𝑢) = 𝑋 → (¬ 𝑋 ∈ 𝑁 → 𝑢 = 𝑤)))
44	43	com13 88	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (¬ 𝑋 ∈ 𝑁 → ((𝐴‘𝑢) = 𝑋 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))
45	39, 44	sylbi 216	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) = 𝑋 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))
46	45	com12 32	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐴‘𝑢) = 𝑋 → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))
47	38, 46	syl6 35	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ 𝑢 ≠ 𝑤) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))
48	47	expcom 414	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑢 ≠ 𝑤 → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
49	48	com23 86	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ≠ 𝑤 → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
50	35, 49	sylbir 234	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ 𝑢 = 𝑤 → (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑢)} ∈ 𝐸) → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
51	34, 50	syl5com 31	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴‘𝑢) = (𝐴‘𝑤) ∧ ({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸)) → (¬ 𝑢 = 𝑤 → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
52	51	expcom 414	. . . . . . . . . . . . . . . 16 ⊢ (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸) → ((𝐴‘𝑢) = (𝐴‘𝑤) → (¬ 𝑢 = 𝑤 → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
53	52	com24 95	. . . . . . . . . . . . . . 15 ⊢ (({𝑢, (𝐴‘𝑢)} ∈ 𝐸 ∧ {𝑤, (𝐴‘𝑤)} ∈ 𝐸) → ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) = (𝐴‘𝑤) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
54	29, 53	mpcom 38	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) = (𝐴‘𝑤) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
55	54	ex 413	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) = (𝐴‘𝑤) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
56	55	com3r 87	. . . . . . . . . . . 12 ⊢ (¬ 𝑢 = 𝑤 → (𝜑 → ((𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) → ((𝐴‘𝑢) = (𝐴‘𝑤) → (𝑋 ∉ 𝑁 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
57	56	com15 101	. . . . . . . . . . 11 ⊢ (𝑋 ∉ 𝑁 → (𝜑 → ((𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) → ((𝐴‘𝑢) = (𝐴‘𝑤) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
58	16, 57	mpcom 38	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷) → ((𝐴‘𝑢) = (𝐴‘𝑤) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))))
59	58	expd 416	. . . . . . . . 9 ⊢ (𝜑 → (𝑢 ∈ 𝐷 → (𝑤 ∈ 𝐷 → ((𝐴‘𝑢) = (𝐴‘𝑤) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
60	59	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴:𝐷⟶𝑁) → (𝑢 ∈ 𝐷 → (𝑤 ∈ 𝐷 → ((𝐴‘𝑢) = (𝐴‘𝑤) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤))))))
61	60	imp42 427	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ (𝐴‘𝑢) = (𝐴‘𝑤)) → (¬ 𝑢 = 𝑤 → ((𝐴‘𝑢) ∈ 𝑁 → 𝑢 = 𝑤)))
62	15, 61	mpid 44	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ (𝐴‘𝑢) = (𝐴‘𝑤)) → (¬ 𝑢 = 𝑤 → 𝑢 = 𝑤))
63	62	pm2.18d 127	. . . . 5 ⊢ ((((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) ∧ (𝐴‘𝑢) = (𝐴‘𝑤)) → 𝑢 = 𝑤)
64	63	ex 413	. . . 4 ⊢ (((𝜑 ∧ 𝐴:𝐷⟶𝑁) ∧ (𝑢 ∈ 𝐷 ∧ 𝑤 ∈ 𝐷)) → ((𝐴‘𝑢) = (𝐴‘𝑤) → 𝑢 = 𝑤))
65	64	ralrimivva 3197	. . 3 ⊢ ((𝜑 ∧ 𝐴:𝐷⟶𝑁) → ∀𝑢 ∈ 𝐷 ∀𝑤 ∈ 𝐷 ((𝐴‘𝑢) = (𝐴‘𝑤) → 𝑢 = 𝑤))
66		dff13 7202	. . 3 ⊢ (𝐴:𝐷–1-1→𝑁 ↔ (𝐴:𝐷⟶𝑁 ∧ ∀𝑢 ∈ 𝐷 ∀𝑤 ∈ 𝐷 ((𝐴‘𝑢) = (𝐴‘𝑤) → 𝑢 = 𝑤)))
67	12, 65, 66	sylanbrc 583	. 2 ⊢ ((𝜑 ∧ 𝐴:𝐷⟶𝑁) → 𝐴:𝐷–1-1→𝑁)
68	11, 67	mpdan 685	1 ⊢ (𝜑 → 𝐴:𝐷–1-1→𝑁)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   ≠ wne 2943   ∉ wnel 3049  ∀wral 3064  {cpr 4588   ↦ cmpt 5188  ⟶wf 6492  –1-1→wf1 6493  ‘cfv 6496  ℩crio 7312  (class class class)co 7357  Vtxcvtx 27947  Edgcedg 27998   NeighbVtx cnbgr 28280   FriendGraph cfrgr 29202

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-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-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-rmo 3353  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-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-hash 14231  df-edg 27999  df-upgr 28033  df-umgr 28034  df-usgr 28102  df-nbgr 28281  df-frgr 29203

This theorem is referenced by:  frgrncvvdeqlem10  29252