Theorem frgrncvvdeqlem9 29993

Description: Lemma 9 for frgrncvvdeq 29995. This corresponds to statement 3 in [Huneke] p. 1: "By symmetry the map is onto". (Contributed by Alexander van der Vekens, 24-Dec-2017.) (Revised by AV, 10-May-2021.) (Proof shortened by AV, 12-Feb-2022.)

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
frgrncvvdeqlem9	⊢ (𝜑 → 𝐴:𝐷–onto→𝑁)

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

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

Proof of Theorem frgrncvvdeqlem9

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 29988	. 2 ⊢ (𝜑 → 𝐴:𝐷⟶𝑁)
12	9	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → 𝐺 ∈ FriendGraph )
13	4	eleq2i 2824	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑁 ↔ 𝑛 ∈ (𝐺 NeighbVtx 𝑌))
14	1	nbgrisvtx 29031	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (𝐺 NeighbVtx 𝑌) → 𝑛 ∈ 𝑉)
15	14	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (𝑛 ∈ (𝐺 NeighbVtx 𝑌) → 𝑛 ∈ 𝑉))
16	13, 15	biimtrid 241	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ 𝑁 → 𝑛 ∈ 𝑉))
17	16	imp 406	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → 𝑛 ∈ 𝑉)
18	5	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → 𝑋 ∈ 𝑉)
19	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	frgrncvvdeqlem1 29985	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∉ 𝑁)
20		df-nel 3046	. . . . . . . . . . 11 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ 𝑁)
21		nelelne 3040	. . . . . . . . . . 11 ⊢ (¬ 𝑋 ∈ 𝑁 → (𝑛 ∈ 𝑁 → 𝑛 ≠ 𝑋))
22	20, 21	sylbi 216	. . . . . . . . . 10 ⊢ (𝑋 ∉ 𝑁 → (𝑛 ∈ 𝑁 → 𝑛 ≠ 𝑋))
23	19, 22	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ 𝑁 → 𝑛 ≠ 𝑋))
24	23	imp 406	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → 𝑛 ≠ 𝑋)
25	17, 18, 24	3jca 1127	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (𝑛 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑛 ≠ 𝑋))
26	12, 25	jca 511	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (𝐺 ∈ FriendGraph ∧ (𝑛 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑛 ≠ 𝑋)))
27	1, 2	frcond2 29953	. . . . . . 7 ⊢ (𝐺 ∈ FriendGraph → ((𝑛 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑛 ≠ 𝑋) → ∃!𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)))
28	27	imp 406	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑛 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ 𝑛 ≠ 𝑋)) → ∃!𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸))
29		reurex 3379	. . . . . . 7 ⊢ (∃!𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → ∃𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸))
30		df-rex 3070	. . . . . . 7 ⊢ (∃𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) ↔ ∃𝑚(𝑚 ∈ 𝑉 ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)))
31	29, 30	sylib 217	. . . . . 6 ⊢ (∃!𝑚 ∈ 𝑉 ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → ∃𝑚(𝑚 ∈ 𝑉 ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)))
32	26, 28, 31	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → ∃𝑚(𝑚 ∈ 𝑉 ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)))
33		frgrusgr 29947	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ FriendGraph → 𝐺 ∈ USGraph)
34	2	nbusgreledg 29043	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ USGraph → (𝑚 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝑚, 𝑋} ∈ 𝐸))
35	34	bicomd 222	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USGraph → ({𝑚, 𝑋} ∈ 𝐸 ↔ 𝑚 ∈ (𝐺 NeighbVtx 𝑋)))
36	9, 33, 35	3syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ({𝑚, 𝑋} ∈ 𝐸 ↔ 𝑚 ∈ (𝐺 NeighbVtx 𝑋)))
37	36	biimpa 476	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝑚 ∈ (𝐺 NeighbVtx 𝑋))
38	3	eleq2i 2824	. . . . . . . . . . 11 ⊢ (𝑚 ∈ 𝐷 ↔ 𝑚 ∈ (𝐺 NeighbVtx 𝑋))
39	37, 38	sylibr 233	. . . . . . . . . 10 ⊢ ((𝜑 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝑚 ∈ 𝐷)
40	39	ad2ant2rl 746	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑁) ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → 𝑚 ∈ 𝐷)
41	2	nbusgreledg 29043	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ USGraph → (𝑛 ∈ (𝐺 NeighbVtx 𝑚) ↔ {𝑛, 𝑚} ∈ 𝐸))
42	41	biimpar 477	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ USGraph ∧ {𝑛, 𝑚} ∈ 𝐸) → 𝑛 ∈ (𝐺 NeighbVtx 𝑚))
43	42	a1d 25	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USGraph ∧ {𝑛, 𝑚} ∈ 𝐸) → ({𝑚, 𝑋} ∈ 𝐸 → 𝑛 ∈ (𝐺 NeighbVtx 𝑚)))
44	43	expimpd 453	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USGraph → (({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝑛 ∈ (𝐺 NeighbVtx 𝑚)))
45	9, 33, 44	3syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝑛 ∈ (𝐺 NeighbVtx 𝑚)))
46	45	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝑛 ∈ (𝐺 NeighbVtx 𝑚)))
47	46	imp 406	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑁) ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → 𝑛 ∈ (𝐺 NeighbVtx 𝑚))
48		elin 3964	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) ↔ (𝑛 ∈ (𝐺 NeighbVtx 𝑚) ∧ 𝑛 ∈ 𝑁))
49		simpl 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ {𝑚, 𝑋} ∈ 𝐸) → 𝜑)
50	49, 39	jca 511	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ {𝑚, 𝑋} ∈ 𝐸) → (𝜑 ∧ 𝑚 ∈ 𝐷))
51		preq1 4737	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑥 = 𝑚 → {𝑥, 𝑦} = {𝑚, 𝑦})
52	51	eleq1d 2817	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑥 = 𝑚 → ({𝑥, 𝑦} ∈ 𝐸 ↔ {𝑚, 𝑦} ∈ 𝐸))
53	52	riotabidv 7370	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 = 𝑚 → (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸) = (℩𝑦 ∈ 𝑁 {𝑚, 𝑦} ∈ 𝐸))
54	53	cbvmptv 5261	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) = (𝑚 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑚, 𝑦} ∈ 𝐸))
55	10, 54	eqtri 2759	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐴 = (𝑚 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑚, 𝑦} ∈ 𝐸))
56	1, 2, 3, 4, 5, 6, 7, 8, 9, 55	frgrncvvdeqlem5 29989	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐷) → {(𝐴‘𝑚)} = ((𝐺 NeighbVtx 𝑚) ∩ 𝑁))
57		eleq2 2821	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐺 NeighbVtx 𝑚) ∩ 𝑁) = {(𝐴‘𝑚)} → (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) ↔ 𝑛 ∈ {(𝐴‘𝑚)}))
58	57	eqcoms 2739	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({(𝐴‘𝑚)} = ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) ↔ 𝑛 ∈ {(𝐴‘𝑚)}))
59		elsni 4645	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ {(𝐴‘𝑚)} → 𝑛 = (𝐴‘𝑚))
60	58, 59	syl6bi 253	. . . . . . . . . . . . . . . . . . 19 ⊢ ({(𝐴‘𝑚)} = ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → 𝑛 = (𝐴‘𝑚)))
61	50, 56, 60	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ {𝑚, 𝑋} ∈ 𝐸) → (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → 𝑛 = (𝐴‘𝑚)))
62	61	expcom 413	. . . . . . . . . . . . . . . . 17 ⊢ ({𝑚, 𝑋} ∈ 𝐸 → (𝜑 → (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → 𝑛 = (𝐴‘𝑚))))
63	62	com3r 87	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ((𝐺 NeighbVtx 𝑚) ∩ 𝑁) → ({𝑚, 𝑋} ∈ 𝐸 → (𝜑 → 𝑛 = (𝐴‘𝑚))))
64	48, 63	sylbir 234	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ (𝐺 NeighbVtx 𝑚) ∧ 𝑛 ∈ 𝑁) → ({𝑚, 𝑋} ∈ 𝐸 → (𝜑 → 𝑛 = (𝐴‘𝑚))))
65	64	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (𝐺 NeighbVtx 𝑚) → (𝑛 ∈ 𝑁 → ({𝑚, 𝑋} ∈ 𝐸 → (𝜑 → 𝑛 = (𝐴‘𝑚)))))
66	65	com14 96	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ 𝑁 → ({𝑚, 𝑋} ∈ 𝐸 → (𝑛 ∈ (𝐺 NeighbVtx 𝑚) → 𝑛 = (𝐴‘𝑚)))))
67	66	imp 406	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → ({𝑚, 𝑋} ∈ 𝐸 → (𝑛 ∈ (𝐺 NeighbVtx 𝑚) → 𝑛 = (𝐴‘𝑚))))
68	67	adantld 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → (𝑛 ∈ (𝐺 NeighbVtx 𝑚) → 𝑛 = (𝐴‘𝑚))))
69	68	imp 406	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑁) ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → (𝑛 ∈ (𝐺 NeighbVtx 𝑚) → 𝑛 = (𝐴‘𝑚)))
70	47, 69	mpd 15	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑁) ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → 𝑛 = (𝐴‘𝑚))
71	40, 70	jca 511	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑁) ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → (𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚)))
72	71	ex 412	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸) → (𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚))))
73	72	adantld 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → ((𝑚 ∈ 𝑉 ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → (𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚))))
74	73	eximdv 1919	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → (∃𝑚(𝑚 ∈ 𝑉 ∧ ({𝑛, 𝑚} ∈ 𝐸 ∧ {𝑚, 𝑋} ∈ 𝐸)) → ∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚))))
75	32, 74	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → ∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚)))
76		df-rex 3070	. . . 4 ⊢ (∃𝑚 ∈ 𝐷 𝑛 = (𝐴‘𝑚) ↔ ∃𝑚(𝑚 ∈ 𝐷 ∧ 𝑛 = (𝐴‘𝑚)))
77	75, 76	sylibr 233	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑁) → ∃𝑚 ∈ 𝐷 𝑛 = (𝐴‘𝑚))
78	77	ralrimiva 3145	. 2 ⊢ (𝜑 → ∀𝑛 ∈ 𝑁 ∃𝑚 ∈ 𝐷 𝑛 = (𝐴‘𝑚))
79		dffo3 7103	. 2 ⊢ (𝐴:𝐷–onto→𝑁 ↔ (𝐴:𝐷⟶𝑁 ∧ ∀𝑛 ∈ 𝑁 ∃𝑚 ∈ 𝐷 𝑛 = (𝐴‘𝑚)))
80	11, 78, 79	sylanbrc 582	1 ⊢ (𝜑 → 𝐴:𝐷–onto→𝑁)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1780   ∈ wcel 2105   ≠ wne 2939   ∉ wnel 3045  ∀wral 3060  ∃wrex 3069  ∃!wreu 3373   ∩ cin 3947  {csn 4628  {cpr 4630   ↦ cmpt 5231  ⟶wf 6539  –onto→wfo 6541  ‘cfv 6543  ℩crio 7367  (class class class)co 7412  Vtxcvtx 28689  Edgcedg 28740  USGraphcusgr 28842   NeighbVtx cnbgr 29022   FriendGraph cfrgr 29944

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729  ax-cnex 11172  ax-resscn 11173  ax-1cn 11174  ax-icn 11175  ax-addcl 11176  ax-addrcl 11177  ax-mulcl 11178  ax-mulrcl 11179  ax-mulcom 11180  ax-addass 11181  ax-mulass 11182  ax-distr 11183  ax-i2m1 11184  ax-1ne0 11185  ax-1rid 11186  ax-rnegex 11187  ax-rrecex 11188  ax-cnre 11189  ax-pre-lttri 11190  ax-pre-lttrn 11191  ax-pre-ltadd 11192  ax-pre-mulgt0 11193

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7368  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7860  df-1st 7979  df-2nd 7980  df-frecs 8272  df-wrecs 8303  df-recs 8377  df-rdg 8416  df-1o 8472  df-2o 8473  df-oadd 8476  df-er 8709  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-dju 9902  df-card 9940  df-pnf 11257  df-mnf 11258  df-xr 11259  df-ltxr 11260  df-le 11261  df-sub 11453  df-neg 11454  df-nn 12220  df-2 12282  df-n0 12480  df-xnn0 12552  df-z 12566  df-uz 12830  df-fz 13492  df-hash 14298  df-edg 28741  df-upgr 28775  df-umgr 28776  df-usgr 28844  df-nbgr 29023  df-frgr 29945

This theorem is referenced by:  frgrncvvdeqlem10  29994