Theorem isubgr3stgrlem8 48874

Description: Lemma 8 for isubgr3stgr 48876. (Contributed by AV, 29-Sep-2025.)

Hypotheses

Ref	Expression
isubgr3stgr.v	⊢ 𝑉 = (Vtx‘𝐺)
isubgr3stgr.u	⊢ 𝑈 = (𝐺 NeighbVtx 𝑋)
isubgr3stgr.c	⊢ 𝐶 = (𝐺 ClNeighbVtx 𝑋)
isubgr3stgr.n	⊢ 𝑁 ∈ ℕ0
isubgr3stgr.s	⊢ 𝑆 = (StarGr‘𝑁)
isubgr3stgr.w	⊢ 𝑊 = (Vtx‘𝑆)
isubgr3stgr.e	⊢ 𝐸 = (Edg‘𝐺)
isubgr3stgr.i	⊢ 𝐼 = (Edg‘(𝐺 ISubGr 𝐶))
isubgr3stgr.h	⊢ 𝐻 = (𝑖 ∈ 𝐼 ↦ (𝐹 “ 𝑖))

Assertion

Ref	Expression
isubgr3stgrlem8	⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐻:𝐼–1-1-onto→(Edg‘(StarGr‘𝑁)))

Distinct variable groups:   𝐶,𝑖   𝑖,𝐹   𝑖,𝐼   𝑖,𝑊   𝑖,𝐸,𝑥,𝑦   𝑖,𝐺   𝑖,𝑁   𝑈,𝑖,𝑥,𝑦   𝑖,𝑉   𝑖,𝑋   𝑦,𝐶   𝑦,𝐹   𝑦,𝐺   𝑦,𝐼   𝑦,𝑁   𝑦,𝑉   𝑦,𝑊   𝑦,𝑋

Allowed substitution hints:   𝐶(𝑥)   𝑆(𝑥, 𝑦, 𝑖)   𝐹(𝑥)   𝐺(𝑥)   𝐻(𝑥, 𝑦, 𝑖)   𝐼(𝑥)   𝑁(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem isubgr3stgrlem8

Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isubgr3stgr.h	. . 3 ⊢ 𝐻 = (𝑖 ∈ 𝐼 ↦ (𝐹 “ 𝑖))
2		imaeq2 6056	. . . 4 ⊢ (𝑖 = 𝑘 → (𝐹 “ 𝑖) = (𝐹 “ 𝑘))
3	2	cbvmptv 5213	. . 3 ⊢ (𝑖 ∈ 𝐼 ↦ (𝐹 “ 𝑖)) = (𝑘 ∈ 𝐼 ↦ (𝐹 “ 𝑘))
4	1, 3	eqtri 2785	. 2 ⊢ 𝐻 = (𝑘 ∈ 𝐼 ↦ (𝐹 “ 𝑘))
5		f1of 6821	. . . . 5 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶⟶𝑊)
6	5	ad2antrl 741	. . . 4 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐹:𝐶⟶𝑊)
7		isubgr3stgr.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
8		isubgr3stgr.u	. . . . 5 ⊢ 𝑈 = (𝐺 NeighbVtx 𝑋)
9		isubgr3stgr.c	. . . . 5 ⊢ 𝐶 = (𝐺 ClNeighbVtx 𝑋)
10		isubgr3stgr.n	. . . . 5 ⊢ 𝑁 ∈ ℕ0
11		isubgr3stgr.s	. . . . 5 ⊢ 𝑆 = (StarGr‘𝑁)
12		isubgr3stgr.w	. . . . 5 ⊢ 𝑊 = (Vtx‘𝑆)
13		isubgr3stgr.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝐺)
14		isubgr3stgr.i	. . . . 5 ⊢ 𝐼 = (Edg‘(𝐺 ISubGr 𝐶))
15	7, 8, 9, 10, 11, 12, 13, 14, 1	isubgr3stgrlem5 48871	. . . 4 ⊢ ((𝐹:𝐶⟶𝑊 ∧ 𝑘 ∈ 𝐼) → (𝐻‘𝑘) = (𝐹 “ 𝑘))
16	6, 15	sylan 592	. . 3 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ 𝑘 ∈ 𝐼) → (𝐻‘𝑘) = (𝐹 “ 𝑘))
17	7, 8, 9, 10, 11, 12, 13, 14, 1	isubgr3stgrlem6 48872	. . . 4 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐻:𝐼⟶(Edg‘(StarGr‘𝑁)))
18	17	ffvelcdmda 7080	. . 3 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ 𝑘 ∈ 𝐼) → (𝐻‘𝑘) ∈ (Edg‘(StarGr‘𝑁)))
19	16, 18	eqeltrrd 2863	. 2 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ 𝑘 ∈ 𝐼) → (𝐹 “ 𝑘) ∈ (Edg‘(StarGr‘𝑁)))
20	7, 8, 9, 10, 11, 12, 13, 14, 1	isubgr3stgrlem7 48873	. . 3 ⊢ (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁))) → (◡𝐹 “ 𝑗) ∈ 𝐼)
21	20	ad4ant134 1193	. 2 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁))) → (◡𝐹 “ 𝑗) ∈ 𝐼)
22		f1ofo 6829	. . . . . 6 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶–onto→𝑊)
23	22	ad2antrl 741	. . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐹:𝐶–onto→𝑊)
24		stgrusgra 48860	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (StarGr‘𝑁) ∈ USGraph)
25	10, 24	mp1i 14	. . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → (StarGr‘𝑁) ∈ USGraph)
26		simpr 490	. . . . . 6 ⊢ ((𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁))) → 𝑗 ∈ (Edg‘(StarGr‘𝑁)))
27	11	fveq2i 6885	. . . . . . . . 9 ⊢ (Vtx‘𝑆) = (Vtx‘(StarGr‘𝑁))
28	12, 27	eqtri 2785	. . . . . . . 8 ⊢ 𝑊 = (Vtx‘(StarGr‘𝑁))
29		eqid 2762	. . . . . . . 8 ⊢ (Edg‘(StarGr‘𝑁)) = (Edg‘(StarGr‘𝑁))
30	28, 29	edgssv2 29642	. . . . . . 7 ⊢ (((StarGr‘𝑁) ∈ USGraph ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁))) → (𝑗 ⊆ 𝑊 ∧ (♯‘𝑗) = 2))
31	30	simpld 500	. . . . . 6 ⊢ (((StarGr‘𝑁) ∈ USGraph ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁))) → 𝑗 ⊆ 𝑊)
32	25, 26, 31	syl2an 608	. . . . 5 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) → 𝑗 ⊆ 𝑊)
33		foimacnv 6839	. . . . 5 ⊢ ((𝐹:𝐶–onto→𝑊 ∧ 𝑗 ⊆ 𝑊) → (𝐹 “ (◡𝐹 “ 𝑗)) = 𝑗)
34	23, 32, 33	syl2an2r 698	. . . 4 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) → (𝐹 “ (◡𝐹 “ 𝑗)) = 𝑗)
35		imaeq2 6056	. . . . 5 ⊢ (𝑘 = (◡𝐹 “ 𝑗) → (𝐹 “ 𝑘) = (𝐹 “ (◡𝐹 “ 𝑗)))
36	35	eqcomd 2768	. . . 4 ⊢ (𝑘 = (◡𝐹 “ 𝑗) → (𝐹 “ (◡𝐹 “ 𝑗)) = (𝐹 “ 𝑘))
37	34, 36	sylan9req 2818	. . 3 ⊢ ((((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) ∧ 𝑘 = (◡𝐹 “ 𝑗)) → 𝑗 = (𝐹 “ 𝑘))
38		imaeq2 6056	. . . . 5 ⊢ (𝑗 = (𝐹 “ 𝑘) → (◡𝐹 “ 𝑗) = (◡𝐹 “ (𝐹 “ 𝑘)))
39		f1of1 6820	. . . . . . 7 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶–1-1→𝑊)
40	39	ad2antrl 741	. . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐹:𝐶–1-1→𝑊)
41		usgruhgr 29630	. . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UHGraph)
42	41	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → 𝐺 ∈ UHGraph)
43	7	clnbgrssvtx 48732	. . . . . . . . . . 11 ⊢ (𝐺 ClNeighbVtx 𝑋) ⊆ 𝑉
44	9, 43	eqsstri 3980	. . . . . . . . . 10 ⊢ 𝐶 ⊆ 𝑉
45	44	a1i 11	. . . . . . . . 9 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → 𝐶 ⊆ 𝑉)
46		eqid 2762	. . . . . . . . . 10 ⊢ (Edg‘𝐺) = (Edg‘𝐺)
47		eqid 2762	. . . . . . . . . 10 ⊢ (𝐺 ISubGr 𝐶) = (𝐺 ISubGr 𝐶)
48	7, 46, 47, 14	isubgredg 48767	. . . . . . . . 9 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐶 ⊆ 𝑉) → (𝑘 ∈ 𝐼 ↔ (𝑘 ∈ (Edg‘𝐺) ∧ 𝑘 ⊆ 𝐶)))
49	42, 45, 48	syl2an 608	. . . . . . . 8 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → (𝑘 ∈ 𝐼 ↔ (𝑘 ∈ (Edg‘𝐺) ∧ 𝑘 ⊆ 𝐶)))
50		simpr 490	. . . . . . . . 9 ⊢ ((𝑘 ∈ (Edg‘𝐺) ∧ 𝑘 ⊆ 𝐶) → 𝑘 ⊆ 𝐶)
51	50	a1d 26	. . . . . . . 8 ⊢ ((𝑘 ∈ (Edg‘𝐺) ∧ 𝑘 ⊆ 𝐶) → (𝑗 ∈ (Edg‘(StarGr‘𝑁)) → 𝑘 ⊆ 𝐶))
52	49, 51	biimtrdi 256	. . . . . . 7 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → (𝑘 ∈ 𝐼 → (𝑗 ∈ (Edg‘(StarGr‘𝑁)) → 𝑘 ⊆ 𝐶)))
53	52	imp32 424	. . . . . 6 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) → 𝑘 ⊆ 𝐶)
54		f1imacnv 6838	. . . . . 6 ⊢ ((𝐹:𝐶–1-1→𝑊 ∧ 𝑘 ⊆ 𝐶) → (◡𝐹 “ (𝐹 “ 𝑘)) = 𝑘)
55	40, 53, 54	syl2an2r 698	. . . . 5 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) → (◡𝐹 “ (𝐹 “ 𝑘)) = 𝑘)
56	38, 55	sylan9eqr 2819	. . . 4 ⊢ ((((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) ∧ 𝑗 = (𝐹 “ 𝑘)) → (◡𝐹 “ 𝑗) = 𝑘)
57	56	eqcomd 2768	. . 3 ⊢ ((((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) ∧ 𝑗 = (𝐹 “ 𝑘)) → 𝑘 = (◡𝐹 “ 𝑗))
58	37, 57	impbida 813	. 2 ⊢ (((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) ∧ (𝑘 ∈ 𝐼 ∧ 𝑗 ∈ (Edg‘(StarGr‘𝑁)))) → (𝑘 = (◡𝐹 “ 𝑗) ↔ 𝑗 = (𝐹 “ 𝑘)))
59	4, 19, 21, 58	f1o2d 7671	1 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0)) → 𝐻:𝐼–1-1-onto→(Edg‘(StarGr‘𝑁)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∉ wnel 3063  ∀wral 3078   ⊆ wss 3902  {cpr 4589   ↦ cmpt 5190  ^◡ccnv 5658   “ cima 5662  ⟶wf 6533  –1-1→wf1 6534  –onto→wfo 6535  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7416  0cc0 11125  2c2 12320  ℕ₀cn0 12529  ♯chash 14394  Vtxcvtx 29437  Edgcedg 29488  UHGraphcuhgr 29497  USGraphcusgr 29593   NeighbVtx cnbgr 29776   ClNeighbVtx cclnbgr 48719   ISubGr cisubgr 48761  StarGrcstgr 48852

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-2o 8459  df-oadd 8462  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-dju 9909  df-card 9947  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-nn 12259  df-2 12328  df-3 12329  df-4 12330  df-5 12331  df-6 12332  df-7 12333  df-8 12334  df-9 12335  df-n0 12530  df-xnn0 12603  df-z 12617  df-dec 12738  df-uz 12889  df-fz 13562  df-hash 14395  df-struct 17241  df-slot 17276  df-ndx 17288  df-base 17304  df-edgf 29430  df-vtx 29439  df-iedg 29440  df-edg 29489  df-uhgr 29499  df-upgr 29523  df-umgr 29524  df-uspgr 29594  df-usgr 29595  df-nbgr 29777  df-clnbgr 48720  df-isubgr 48762  df-stgr 48853

This theorem is used by:  isubgr3stgrlem9  48875