Theorem isubgr3stgrlem4 48445

Description: Lemma 4 for isubgr3stgr 48451. (Contributed by AV, 24-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‘𝐺)

Assertion

Ref	Expression
isubgr3stgrlem4	⊢ ((𝐴 = 𝑋 ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧})

Distinct variable groups:   𝑧,𝐴   𝑧,𝐵   𝑧,𝐶   𝑧,𝐹   𝑧,𝑁   𝑧,𝑊   𝑧,𝑋

Allowed substitution hints:   𝑆(𝑧)   𝑈(𝑧)   𝐸(𝑧)   𝐺(𝑧)   𝑉(𝑧)

Proof of Theorem isubgr3stgrlem4

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		preq2 4678	. . . . . 6 ⊢ (𝑧 = (𝐹‘𝐵) → {0, 𝑧} = {0, (𝐹‘𝐵)})
2	1	eqeq2d 2747	. . . . 5 ⊢ (𝑧 = (𝐹‘𝐵) → ((𝐹 “ {𝑋, 𝐵}) = {0, 𝑧} ↔ (𝐹 “ {𝑋, 𝐵}) = {0, (𝐹‘𝐵)}))
3		f1of 6780	. . . . . . . . 9 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶⟶𝑊)
4	3	adantr 480	. . . . . . . 8 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → 𝐹:𝐶⟶𝑊)
5	4	adantr 480	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → 𝐹:𝐶⟶𝑊)
6		simpr3 1198	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → 𝐵 ∈ 𝐶)
7	5, 6	ffvelcdmd 7037	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹‘𝐵) ∈ 𝑊)
8		isubgr3stgr.w	. . . . . . . . . 10 ⊢ 𝑊 = (Vtx‘𝑆)
9		isubgr3stgr.s	. . . . . . . . . . 11 ⊢ 𝑆 = (StarGr‘𝑁)
10	9	fveq2i 6843	. . . . . . . . . 10 ⊢ (Vtx‘𝑆) = (Vtx‘(StarGr‘𝑁))
11		isubgr3stgr.n	. . . . . . . . . . 11 ⊢ 𝑁 ∈ ℕ0
12		stgrvtx 48430	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (Vtx‘(StarGr‘𝑁)) = (0...𝑁))
13	11, 12	ax-mp 5	. . . . . . . . . 10 ⊢ (Vtx‘(StarGr‘𝑁)) = (0...𝑁)
14	8, 10, 13	3eqtri 2763	. . . . . . . . 9 ⊢ 𝑊 = (0...𝑁)
15	14	eleq2i 2828	. . . . . . . 8 ⊢ ((𝐹‘𝐵) ∈ 𝑊 ↔ (𝐹‘𝐵) ∈ (0...𝑁))
16		fz0sn0fz1 13599	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = ({0} ∪ (1...𝑁)))
17	11, 16	ax-mp 5	. . . . . . . . 9 ⊢ (0...𝑁) = ({0} ∪ (1...𝑁))
18	17	eleq2i 2828	. . . . . . . 8 ⊢ ((𝐹‘𝐵) ∈ (0...𝑁) ↔ (𝐹‘𝐵) ∈ ({0} ∪ (1...𝑁)))
19		elun 4093	. . . . . . . . 9 ⊢ ((𝐹‘𝐵) ∈ ({0} ∪ (1...𝑁)) ↔ ((𝐹‘𝐵) ∈ {0} ∨ (𝐹‘𝐵) ∈ (1...𝑁)))
20		fvex 6853	. . . . . . . . . . 11 ⊢ (𝐹‘𝐵) ∈ V
21	20	elsn 4582	. . . . . . . . . 10 ⊢ ((𝐹‘𝐵) ∈ {0} ↔ (𝐹‘𝐵) = 0)
22	21	orbi1i 914	. . . . . . . . 9 ⊢ (((𝐹‘𝐵) ∈ {0} ∨ (𝐹‘𝐵) ∈ (1...𝑁)) ↔ ((𝐹‘𝐵) = 0 ∨ (𝐹‘𝐵) ∈ (1...𝑁)))
23	19, 22	bitri 275	. . . . . . . 8 ⊢ ((𝐹‘𝐵) ∈ ({0} ∪ (1...𝑁)) ↔ ((𝐹‘𝐵) = 0 ∨ (𝐹‘𝐵) ∈ (1...𝑁)))
24	15, 18, 23	3bitri 297	. . . . . . 7 ⊢ ((𝐹‘𝐵) ∈ 𝑊 ↔ ((𝐹‘𝐵) = 0 ∨ (𝐹‘𝐵) ∈ (1...𝑁)))
25		eqeq2 2748	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑋) = 0 → ((𝐹‘𝐵) = (𝐹‘𝑋) ↔ (𝐹‘𝐵) = 0))
26	25	adantl 481	. . . . . . . . . 10 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → ((𝐹‘𝐵) = (𝐹‘𝑋) ↔ (𝐹‘𝐵) = 0))
27	26	adantr 480	. . . . . . . . 9 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐵) = (𝐹‘𝑋) ↔ (𝐹‘𝐵) = 0))
28		f1of1 6779	. . . . . . . . . . . 12 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶–1-1→𝑊)
29		dff14a 7225	. . . . . . . . . . . . 13 ⊢ (𝐹:𝐶–1-1→𝑊 ↔ (𝐹:𝐶⟶𝑊 ∧ ∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏))))
30		simpl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → 𝑎 = 𝑋)
31		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
32	30, 31	neeq12d 2993	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝑎 ≠ 𝑏 ↔ 𝑋 ≠ 𝐵))
33		fveq2 6840	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑋 → (𝐹‘𝑎) = (𝐹‘𝑋))
34	33	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝐹‘𝑎) = (𝐹‘𝑋))
35		fveq2 6840	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝐵 → (𝐹‘𝑏) = (𝐹‘𝐵))
36	35	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝐹‘𝑏) = (𝐹‘𝐵))
37	34, 36	neeq12d 2993	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → ((𝐹‘𝑎) ≠ (𝐹‘𝑏) ↔ (𝐹‘𝑋) ≠ (𝐹‘𝐵)))
38	32, 37	imbi12d 344	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → ((𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) ↔ (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
39	38	rspc2gv 3574	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
40	39	3adant1 1131	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
41		id 22	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)))
42		eqneqall 2943	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑋) = (𝐹‘𝐵) → ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → (𝐹‘𝐵) ∈ (1...𝑁)))
43	42	eqcoms 2744	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹‘𝐵) = (𝐹‘𝑋) → ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → (𝐹‘𝐵) ∈ (1...𝑁)))
44	43	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁)))
45	41, 44	syl6com 37	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ≠ 𝐵 → ((𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
46	45	3ad2ant1 1134	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
47	40, 46	syld 47	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
48	47	adantld 490	. . . . . . . . . . . . 13 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹:𝐶⟶𝑊 ∧ ∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏))) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
49	29, 48	biimtrid 242	. . . . . . . . . . . 12 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐹:𝐶–1-1→𝑊 → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
50	28, 49	syl5com 31	. . . . . . . . . . 11 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
51	50	adantr 480	. . . . . . . . . 10 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
52	51	imp 406	. . . . . . . . 9 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁)))
53	27, 52	sylbird 260	. . . . . . . 8 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐵) = 0 → (𝐹‘𝐵) ∈ (1...𝑁)))
54		idd 24	. . . . . . . 8 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐵) ∈ (1...𝑁) → (𝐹‘𝐵) ∈ (1...𝑁)))
55	53, 54	jaod 860	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (((𝐹‘𝐵) = 0 ∨ (𝐹‘𝐵) ∈ (1...𝑁)) → (𝐹‘𝐵) ∈ (1...𝑁)))
56	24, 55	biimtrid 242	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐵) ∈ 𝑊 → (𝐹‘𝐵) ∈ (1...𝑁)))
57	7, 56	mpd 15	. . . . 5 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹‘𝐵) ∈ (1...𝑁))
58		f1ofn 6781	. . . . . . . . . 10 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹 Fn 𝐶)
59	58	adantr 480	. . . . . . . . 9 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → 𝐹 Fn 𝐶)
60		3simpc 1151	. . . . . . . . 9 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
61	59, 60	anim12i 614	. . . . . . . 8 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 Fn 𝐶 ∧ (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
62		3anass 1095	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐶 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ (𝐹 Fn 𝐶 ∧ (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
63	61, 62	sylibr 234	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 Fn 𝐶 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
64		fnimapr 6923	. . . . . . 7 ⊢ ((𝐹 Fn 𝐶 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐹 “ {𝑋, 𝐵}) = {(𝐹‘𝑋), (𝐹‘𝐵)})
65	63, 64	syl 17	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 “ {𝑋, 𝐵}) = {(𝐹‘𝑋), (𝐹‘𝐵)})
66		simpr 484	. . . . . . . 8 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → (𝐹‘𝑋) = 0)
67	66	adantr 480	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹‘𝑋) = 0)
68	67	preq1d 4683	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → {(𝐹‘𝑋), (𝐹‘𝐵)} = {0, (𝐹‘𝐵)})
69	65, 68	eqtrd 2771	. . . . 5 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 “ {𝑋, 𝐵}) = {0, (𝐹‘𝐵)})
70	2, 57, 69	rspcedvdw 3567	. . . 4 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧})
71	70	ex 412	. . 3 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧}))
72		neeq1 2994	. . . . 5 ⊢ (𝐴 = 𝑋 → (𝐴 ≠ 𝐵 ↔ 𝑋 ≠ 𝐵))
73		eleq1 2824	. . . . 5 ⊢ (𝐴 = 𝑋 → (𝐴 ∈ 𝐶 ↔ 𝑋 ∈ 𝐶))
74	72, 73	3anbi12d 1440	. . . 4 ⊢ (𝐴 = 𝑋 → ((𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
75		preq1 4677	. . . . . . 7 ⊢ (𝐴 = 𝑋 → {𝐴, 𝐵} = {𝑋, 𝐵})
76	75	imaeq2d 6025	. . . . . 6 ⊢ (𝐴 = 𝑋 → (𝐹 “ {𝐴, 𝐵}) = (𝐹 “ {𝑋, 𝐵}))
77	76	eqeq1d 2738	. . . . 5 ⊢ (𝐴 = 𝑋 → ((𝐹 “ {𝐴, 𝐵}) = {0, 𝑧} ↔ (𝐹 “ {𝑋, 𝐵}) = {0, 𝑧}))
78	77	rexbidv 3161	. . . 4 ⊢ (𝐴 = 𝑋 → (∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧} ↔ ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧}))
79	74, 78	imbi12d 344	. . 3 ⊢ (𝐴 = 𝑋 → (((𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧}) ↔ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧})))
80	71, 79	imbitrrid 246	. 2 ⊢ (𝐴 = 𝑋 → ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → ((𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧})))
81	80	3imp 1111	1 ⊢ ((𝐴 = 𝑋 ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2932  ∀wral 3051  ∃wrex 3061   ∪ cun 3887  {csn 4567  {cpr 4569   “ cima 5634   Fn wfn 6493  ⟶wf 6494  –1-1→wf1 6495  –1-1-onto→wf1o 6497  ‘cfv 6498  (class class class)co 7367  0cc0 11038  1c1 11039  ℕ₀cn0 12437  ...cfz 13461  Vtxcvtx 29065  Edgcedg 29116   NeighbVtx cnbgr 29401   ClNeighbVtx cclnbgr 48294  StarGrcstgr 48427

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-dju 9825  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-3 12245  df-4 12246  df-5 12247  df-6 12248  df-7 12249  df-8 12250  df-9 12251  df-n0 12438  df-xnn0 12511  df-z 12525  df-dec 12645  df-uz 12789  df-fz 13462  df-hash 14293  df-struct 17117  df-slot 17152  df-ndx 17164  df-base 17180  df-edgf 29058  df-vtx 29067  df-stgr 48428

This theorem is referenced by:  isubgr3stgrlem6  48447