Theorem grilcbri2 49203

Description: Implications of two graphs being locally isomorphic. (Contributed by AV, 9-Jun-2025.)

Hypotheses

Ref	Expression
dfgrlic2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfgrlic2.w	⊢ 𝑊 = (Vtx‘𝐻)
dfgrlic3.i	⊢ 𝐼 = (iEdg‘𝐺)
dfgrlic3.j	⊢ 𝐽 = (iEdg‘𝐻)
grilcbri2.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
grilcbri2.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑋))
grilcbri2.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
grilcbri2.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
grilcbri2	⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

Distinct variable groups:   𝑓,𝐺   𝑓,𝐻   𝑓,𝑋   𝑔,𝐺,𝑖,𝑗,𝑓   𝑥,𝐺   𝑔,𝐻,𝑖,𝑗   𝑥,𝐻   𝑖,𝐼,𝑥   𝑖,𝐽,𝑥   𝑖,𝐾   𝑔,𝑋,𝑗   𝑥,𝑋,𝑓

Allowed substitution hints:   𝐼(𝑓, 𝑔, 𝑗)   𝐽(𝑓, 𝑔, 𝑗)   𝐾(𝑥, 𝑓, 𝑔, 𝑗)   𝐿(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑀(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑁(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑉(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑊(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑋(𝑖)

Proof of Theorem grilcbri2

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brgrlic 49196	. . 3 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ (𝐺 GraphLocIso 𝐻) ≠ ∅)
2		grlimdmrel 49172	. . . . 5 ⊢ Rel dom GraphLocIso
3	2	ovprc 7459	. . . 4 ⊢ (¬ (𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 GraphLocIso 𝐻) = ∅)
4	3	necon1ai 2982	. . 3 ⊢ ((𝐺 GraphLocIso 𝐻) ≠ ∅ → (𝐺 ∈ V ∧ 𝐻 ∈ V))
5	1, 4	sylbi 220	. 2 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → (𝐺 ∈ V ∧ 𝐻 ∈ V))
6		dfgrlic2.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
7		dfgrlic2.w	. . . 4 ⊢ 𝑊 = (Vtx‘𝐻)
8		dfgrlic3.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
9		dfgrlic3.j	. . . 4 ⊢ 𝐽 = (iEdg‘𝐻)
10		eqid 2760	. . . 4 ⊢ (𝐺 ClNeighbVtx 𝑣) = (𝐺 ClNeighbVtx 𝑣)
11		eqid 2760	. . . 4 ⊢ (𝐻 ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝑓‘𝑣))
12		eqid 2760	. . . 4 ⊢ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}
13		eqid 2760	. . . 4 ⊢ {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))}
14	6, 7, 8, 9, 10, 11, 12, 13	dfgrlic3 49202	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
15		eqidd 2761	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → 𝑗 = 𝑗)
16		oveq2 7429	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝐺 ClNeighbVtx 𝑣) = (𝐺 ClNeighbVtx 𝑋))
17		grilcbri2.n	. . . . . . . . . . . 12 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
18	16, 17	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → (𝐺 ClNeighbVtx 𝑣) = 𝑁)
19		fveq2 6886	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → (𝑓‘𝑣) = (𝑓‘𝑋))
20	19	oveq2d 7437	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝐻 ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝑓‘𝑋)))
21		grilcbri2.m	. . . . . . . . . . . 12 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑋))
22	20, 21	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → (𝐻 ClNeighbVtx (𝑓‘𝑣)) = 𝑀)
23	15, 18, 22	f1oeq123d 6819	. . . . . . . . . 10 ⊢ (𝑣 = 𝑋 → (𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ↔ 𝑗:𝑁–1-1-onto→𝑀))
24		eqidd 2761	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → 𝑔 = 𝑔)
25	18	sseq2d 3940	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑋 → ((𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣) ↔ (𝐼‘𝑥) ⊆ 𝑁))
26	25	rabbidv 3419	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁})
27		grilcbri2.k	. . . . . . . . . . . . . 14 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
28	26, 27	eqtr4di 2813	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = 𝐾)
29	22	sseq2d 3940	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑋 → ((𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣)) ↔ (𝐽‘𝑥) ⊆ 𝑀))
30	29	rabbidv 3419	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀})
31		grilcbri2.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
32	30, 31	eqtr4di 2813	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = 𝐿)
33	24, 28, 32	f1oeq123d 6819	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ↔ 𝑔:𝐾–1-1-onto→𝐿))
34	28	raleqdv 3319	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))
35	33, 34	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → ((𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))) ↔ (𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))
36	35	exbidv 1953	. . . . . . . . . 10 ⊢ (𝑣 = 𝑋 → (∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))) ↔ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))
37	23, 36	anbi12d 644	. . . . . . . . 9 ⊢ (𝑣 = 𝑋 → ((𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) ↔ (𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
38	37	exbidv 1953	. . . . . . . 8 ⊢ (𝑣 = 𝑋 → (∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) ↔ ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
39	38	rspcv 3572	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
40	39	com12 33	. . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
41	40	a1i 11	. . . . 5 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
42	41	anim2d 624	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → ((𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))) → (𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
43	42	eximdv 1949	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))) → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
44	14, 43	sylbid 243	. 2 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
45	5, 44	mpcom 39	1 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  {crab 3412  Vcvv 3450   ⊆ wss 3895  ∅c0 4278   class class class wbr 5102  dom cdm 5650   “ cima 5653  –1-1-onto→wf1o 6538  ‘cfv 6539  (class class class)co 7421  Vtxcvtx 29580  iEdgciedg 29581   ClNeighbVtx cclnbgr 49010   GraphLocIso cgrlim 49168   ≃_𝑙𝑔𝑟 cgrlic 49169

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-1o 8480  df-map 8853  df-vtx 29582  df-iedg 29583  df-clnbgr 49011  df-isubgr 49053  df-grim 49070  df-gric 49073  df-grlim 49170  df-grlic 49173

This theorem is used by: (None)