Theorem frgrregorufr0 41489

Description: In a friendship graph there are either no vertices having degree 𝐾, or all vertices have degree 𝐾 for any (nonnegative integer) 𝐾, unless there is a universal friend. This corresponds to claim 2 in [Huneke] p. 2: "... all vertices have degree k, unless there is a universal friend." (Contributed by Alexander van der Vekens, 1-Jan-2018.) (Revised by AV, 11-May-2021.)

Hypotheses

Ref	Expression
frgrregorufr0.v	⊢ 𝑉 = (Vtx‘𝐺)
frgrregorufr0.e	⊢ 𝐸 = (Edg‘𝐺)
frgrregorufr0.d	⊢ 𝐷 = (VtxDeg‘𝐺)

Assertion

Ref	Expression
frgrregorufr0	⊢ (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸))

Distinct variable groups:   𝑣,𝐷,𝑤   𝑣,𝐸   𝑤,𝐺   𝑣,𝐾,𝑤   𝑣,𝑉,𝑤

Allowed substitution hints:   𝐸(𝑤)   𝐺(𝑣)

Proof of Theorem frgrregorufr0

Dummy variables 𝑟 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frgrregorufr0.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		frgrregorufr0.d	. . . 4 ⊢ 𝐷 = (VtxDeg‘𝐺)
3		fveq2 6103	. . . . . 6 ⊢ (𝑣 = 𝑡 → (𝐷‘𝑣) = (𝐷‘𝑡))
4	3	eqeq1d 2612	. . . . 5 ⊢ (𝑣 = 𝑡 → ((𝐷‘𝑣) = 𝐾 ↔ (𝐷‘𝑡) = 𝐾))
5	4	cbvrabv 3172	. . . 4 ⊢ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = {𝑡 ∈ 𝑉 ∣ (𝐷‘𝑡) = 𝐾}
6		eqid 2610	. . . 4 ⊢ (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})
7		frgrregorufr0.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐺)
8	1, 2, 5, 6, 7	frgrwopreg 41486	. . 3 ⊢ (𝐺 ∈ FriendGraph → (((#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1 ∨ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = ∅) ∨ ((#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1 ∨ (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = ∅)))
9		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑣 = 𝑟 → (𝐷‘𝑣) = (𝐷‘𝑟))
10	9	eqeq1d 2612	. . . . . . . . 9 ⊢ (𝑣 = 𝑟 → ((𝐷‘𝑣) = 𝐾 ↔ (𝐷‘𝑟) = 𝐾))
11	10	cbvrabv 3172	. . . . . . . 8 ⊢ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = {𝑟 ∈ 𝑉 ∣ (𝐷‘𝑟) = 𝐾}
12		fveq2 6103	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑣 → (𝐷‘𝑠) = (𝐷‘𝑣))
13	12	eqeq1d 2612	. . . . . . . . . 10 ⊢ (𝑠 = 𝑣 → ((𝐷‘𝑠) = 𝐾 ↔ (𝐷‘𝑣) = 𝐾))
14	13	cbvrabv 3172	. . . . . . . . 9 ⊢ {𝑠 ∈ 𝑉 ∣ (𝐷‘𝑠) = 𝐾} = {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}
15	14	difeq2i 3687	. . . . . . . 8 ⊢ (𝑉 ∖ {𝑠 ∈ 𝑉 ∣ (𝐷‘𝑠) = 𝐾}) = (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})
16	1, 2, 11, 15, 7	frgrwopreg1 41487	. . . . . . 7 ⊢ ((𝐺 ∈ FriendGraph ∧ (#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1) → ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)
17	16	3mix3d 1231	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ (#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1) → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
18	17	expcom 450	. . . . 5 ⊢ ((#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1 → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
19		rabeq0 3911	. . . . . 6 ⊢ ({𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ (𝐷‘𝑣) = 𝐾)
20		neqne 2790	. . . . . . . . 9 ⊢ (¬ (𝐷‘𝑣) = 𝐾 → (𝐷‘𝑣) ≠ 𝐾)
21	20	ralimi 2936	. . . . . . . 8 ⊢ (∀𝑣 ∈ 𝑉 ¬ (𝐷‘𝑣) = 𝐾 → ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾)
22	21	3mix2d 1230	. . . . . . 7 ⊢ (∀𝑣 ∈ 𝑉 ¬ (𝐷‘𝑣) = 𝐾 → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
23	22	a1d 25	. . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 ¬ (𝐷‘𝑣) = 𝐾 → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
24	19, 23	sylbi 206	. . . . 5 ⊢ ({𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = ∅ → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
25	18, 24	jaoi 393	. . . 4 ⊢ (((#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1 ∨ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = ∅) → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
26		fveq2 6103	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → (𝐷‘𝑟) = (𝐷‘𝑠))
27	26	eqeq1d 2612	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → ((𝐷‘𝑟) = 𝐾 ↔ (𝐷‘𝑠) = 𝐾))
28	27	cbvrabv 3172	. . . . . . . 8 ⊢ {𝑟 ∈ 𝑉 ∣ (𝐷‘𝑟) = 𝐾} = {𝑠 ∈ 𝑉 ∣ (𝐷‘𝑠) = 𝐾}
29	11	difeq2i 3687	. . . . . . . 8 ⊢ (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = (𝑉 ∖ {𝑟 ∈ 𝑉 ∣ (𝐷‘𝑟) = 𝐾})
30	1, 2, 28, 29, 7	frgrwopreg2 41488	. . . . . . 7 ⊢ ((𝐺 ∈ FriendGraph ∧ (#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1) → ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)
31	30	3mix3d 1231	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ (#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1) → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
32	31	expcom 450	. . . . 5 ⊢ ((#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1 → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
33		difrab0eq 3990	. . . . . 6 ⊢ ((𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = ∅ ↔ 𝑉 = {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})
34		rabid2 3096	. . . . . . 7 ⊢ (𝑉 = {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} ↔ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾)
35		3mix1 1223	. . . . . . . 8 ⊢ (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
36	35	a1d 25	. . . . . . 7 ⊢ (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
37	34, 36	sylbi 206	. . . . . 6 ⊢ (𝑉 = {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
38	33, 37	sylbi 206	. . . . 5 ⊢ ((𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = ∅ → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
39	32, 38	jaoi 393	. . . 4 ⊢ (((#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1 ∨ (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = ∅) → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
40	25, 39	jaoi 393	. . 3 ⊢ ((((#‘{𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = 1 ∨ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾} = ∅) ∨ ((#‘(𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾})) = 1 ∨ (𝑉 ∖ {𝑣 ∈ 𝑉 ∣ (𝐷‘𝑣) = 𝐾}) = ∅)) → (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
41	8, 40	mpcom 37	. 2 ⊢ (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
42		biidd 251	. . 3 ⊢ (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ↔ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾))
43		biidd 251	. . 3 ⊢ (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ↔ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾))
44		sneq 4135	. . . . . . 7 ⊢ (𝑣 = 𝑡 → {𝑣} = {𝑡})
45	44	difeq2d 3690	. . . . . 6 ⊢ (𝑣 = 𝑡 → (𝑉 ∖ {𝑣}) = (𝑉 ∖ {𝑡}))
46		preq1 4212	. . . . . . 7 ⊢ (𝑣 = 𝑡 → {𝑣, 𝑤} = {𝑡, 𝑤})
47	46	eleq1d 2672	. . . . . 6 ⊢ (𝑣 = 𝑡 → ({𝑣, 𝑤} ∈ 𝐸 ↔ {𝑡, 𝑤} ∈ 𝐸))
48	45, 47	raleqbidv 3129	. . . . 5 ⊢ (𝑣 = 𝑡 → (∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸 ↔ ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
49	48	cbvrexv 3148	. . . 4 ⊢ (∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)
50	49	a1i 11	. . 3 ⊢ (𝐺 ∈ FriendGraph → (∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸))
51	42, 43, 50	3orbi123d 1390	. 2 ⊢ (𝐺 ∈ FriendGraph → ((∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸) ↔ (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑡 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑡}){𝑡, 𝑤} ∈ 𝐸)))
52	41, 51	mpbird 246	1 ⊢ (𝐺 ∈ FriendGraph → (∀𝑣 ∈ 𝑉 (𝐷‘𝑣) = 𝐾 ∨ ∀𝑣 ∈ 𝑉 (𝐷‘𝑣) ≠ 𝐾 ∨ ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ 𝐸))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   ∨ w3o 1030   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900   ∖ cdif 3537  ∅c0 3874  {csn 4125  {cpr 4127  ‘cfv 5804  1c1 9816  #chash 12979  Vtxcvtx 25673  Edgcedga 25792  VtxDegcvtxdg 40681   FriendGraph cfrgr 41428

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-fal 1481  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-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-xnn0 11241  df-z 11255  df-uz 11564  df-xadd 11823  df-fz 12198  df-hash 12980  df-uhgr 25724  df-ushgr 25725  df-upgr 25749  df-umgr 25750  df-edga 25793  df-uspgr 40380  df-usgr 40381  df-nbgr 40554  df-vtxdg 40682  df-frgr 41429

This theorem is referenced by:  frgrregorufr  41490