Theorem isubgr3stgrlem4 47871

Description: Lemma 4 for isubgr3stgr 47877. (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 4738	. . . . . 6 ⊢ (𝑧 = (𝐹‘𝐵) → {0, 𝑧} = {0, (𝐹‘𝐵)})
2	1	eqeq2d 2745	. . . . 5 ⊢ (𝑧 = (𝐹‘𝐵) → ((𝐹 “ {𝑋, 𝐵}) = {0, 𝑧} ↔ (𝐹 “ {𝑋, 𝐵}) = {0, (𝐹‘𝐵)}))
3		f1of 6848	. . . . . . . . 9 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶⟶𝑊)
4	3	adantr 480	. . . . . . . 8 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → 𝐹:𝐶⟶𝑊)
5	4	adantr 480	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → 𝐹:𝐶⟶𝑊)
6		simpr3 1195	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → 𝐵 ∈ 𝐶)
7	5, 6	ffvelcdmd 7104	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹‘𝐵) ∈ 𝑊)
8		isubgr3stgr.w	. . . . . . . . . 10 ⊢ 𝑊 = (Vtx‘𝑆)
9		isubgr3stgr.s	. . . . . . . . . . 11 ⊢ 𝑆 = (StarGr‘𝑁)
10	9	fveq2i 6909	. . . . . . . . . 10 ⊢ (Vtx‘𝑆) = (Vtx‘(StarGr‘𝑁))
11		isubgr3stgr.n	. . . . . . . . . . 11 ⊢ 𝑁 ∈ ℕ0
12		stgrvtx 47856	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (Vtx‘(StarGr‘𝑁)) = (0...𝑁))
13	11, 12	ax-mp 5	. . . . . . . . . 10 ⊢ (Vtx‘(StarGr‘𝑁)) = (0...𝑁)
14	8, 10, 13	3eqtri 2766	. . . . . . . . 9 ⊢ 𝑊 = (0...𝑁)
15	14	eleq2i 2830	. . . . . . . 8 ⊢ ((𝐹‘𝐵) ∈ 𝑊 ↔ (𝐹‘𝐵) ∈ (0...𝑁))
16		fz0sn0fz1 13681	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = ({0} ∪ (1...𝑁)))
17	11, 16	ax-mp 5	. . . . . . . . 9 ⊢ (0...𝑁) = ({0} ∪ (1...𝑁))
18	17	eleq2i 2830	. . . . . . . 8 ⊢ ((𝐹‘𝐵) ∈ (0...𝑁) ↔ (𝐹‘𝐵) ∈ ({0} ∪ (1...𝑁)))
19		elun 4162	. . . . . . . . 9 ⊢ ((𝐹‘𝐵) ∈ ({0} ∪ (1...𝑁)) ↔ ((𝐹‘𝐵) ∈ {0} ∨ (𝐹‘𝐵) ∈ (1...𝑁)))
20		fvex 6919	. . . . . . . . . . 11 ⊢ (𝐹‘𝐵) ∈ V
21	20	elsn 4645	. . . . . . . . . 10 ⊢ ((𝐹‘𝐵) ∈ {0} ↔ (𝐹‘𝐵) = 0)
22	21	orbi1i 913	. . . . . . . . 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 2746	. . . . . . . . . . 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 6847	. . . . . . . . . . . 12 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹:𝐶–1-1→𝑊)
29		dff14a 7289	. . . . . . . . . . . . 13 ⊢ (𝐹:𝐶–1-1→𝑊 ↔ (𝐹:𝐶⟶𝑊 ∧ ∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏))))
30		simpl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → 𝑎 = 𝑋)
31		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
32	30, 31	neeq12d 2999	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝑎 ≠ 𝑏 ↔ 𝑋 ≠ 𝐵))
33		fveq2 6906	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑋 → (𝐹‘𝑎) = (𝐹‘𝑋))
34	33	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝐹‘𝑎) = (𝐹‘𝑋))
35		fveq2 6906	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝐵 → (𝐹‘𝑏) = (𝐹‘𝐵))
36	35	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → (𝐹‘𝑏) = (𝐹‘𝐵))
37	34, 36	neeq12d 2999	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → ((𝐹‘𝑎) ≠ (𝐹‘𝑏) ↔ (𝐹‘𝑋) ≠ (𝐹‘𝐵)))
38	32, 37	imbi12d 344	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝑋 ∧ 𝑏 = 𝐵) → ((𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) ↔ (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
39	38	rspc2gv 3631	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
40	39	3adant1 1129	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (∀𝑎 ∈ 𝐶 ∀𝑏 ∈ 𝐶 (𝑎 ≠ 𝑏 → (𝐹‘𝑎) ≠ (𝐹‘𝑏)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵))))
41		id 22	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)) → (𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)))
42		eqneqall 2948	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑋) = (𝐹‘𝐵) → ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → (𝐹‘𝐵) ∈ (1...𝑁)))
43	42	eqcoms 2742	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹‘𝐵) = (𝐹‘𝑋) → ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → (𝐹‘𝐵) ∈ (1...𝑁)))
44	43	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹‘𝑋) ≠ (𝐹‘𝐵) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁)))
45	41, 44	syl6com 37	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ≠ 𝐵 → ((𝑋 ≠ 𝐵 → (𝐹‘𝑋) ≠ (𝐹‘𝐵)) → ((𝐹‘𝐵) = (𝐹‘𝑋) → (𝐹‘𝐵) ∈ (1...𝑁))))
46	45	3ad2ant1 1132	. . . . . . . . . . . . . . 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 859	. . . . . . 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 6849	. . . . . . . . . 10 ⊢ (𝐹:𝐶–1-1-onto→𝑊 → 𝐹 Fn 𝐶)
59	58	adantr 480	. . . . . . . . 9 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → 𝐹 Fn 𝐶)
60		3simpc 1149	. . . . . . . . 9 ⊢ ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
61	59, 60	anim12i 613	. . . . . . . 8 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 Fn 𝐶 ∧ (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
62		3anass 1094	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐶 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ (𝐹 Fn 𝐶 ∧ (𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
63	61, 62	sylibr 234	. . . . . . 7 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 Fn 𝐶 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶))
64		fnimapr 6991	. . . . . . 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 4743	. . . . . 6 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → {(𝐹‘𝑋), (𝐹‘𝐵)} = {0, (𝐹‘𝐵)})
69	65, 68	eqtrd 2774	. . . . 5 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐹 “ {𝑋, 𝐵}) = {0, (𝐹‘𝐵)})
70	2, 57, 69	rspcedvdw 3624	. . . 4 ⊢ (((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧})
71	70	ex 412	. . 3 ⊢ ((𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) → ((𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝑋, 𝐵}) = {0, 𝑧}))
72		neeq1 3000	. . . . 5 ⊢ (𝐴 = 𝑋 → (𝐴 ≠ 𝐵 ↔ 𝑋 ≠ 𝐵))
73		eleq1 2826	. . . . 5 ⊢ (𝐴 = 𝑋 → (𝐴 ∈ 𝐶 ↔ 𝑋 ∈ 𝐶))
74	72, 73	3anbi12d 1436	. . . 4 ⊢ (𝐴 = 𝑋 → ((𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ↔ (𝑋 ≠ 𝐵 ∧ 𝑋 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)))
75		preq1 4737	. . . . . . 7 ⊢ (𝐴 = 𝑋 → {𝐴, 𝐵} = {𝑋, 𝐵})
76	75	imaeq2d 6079	. . . . . 6 ⊢ (𝐴 = 𝑋 → (𝐹 “ {𝐴, 𝐵}) = (𝐹 “ {𝑋, 𝐵}))
77	76	eqeq1d 2736	. . . . 5 ⊢ (𝐴 = 𝑋 → ((𝐹 “ {𝐴, 𝐵}) = {0, 𝑧} ↔ (𝐹 “ {𝑋, 𝐵}) = {0, 𝑧}))
78	77	rexbidv 3176	. . . 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 1110	1 ⊢ ((𝐴 = 𝑋 ∧ (𝐹:𝐶–1-1-onto→𝑊 ∧ (𝐹‘𝑋) = 0) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ∃𝑧 ∈ (1...𝑁)(𝐹 “ {𝐴, 𝐵}) = {0, 𝑧})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1536   ∈ wcel 2105   ≠ wne 2937  ∀wral 3058  ∃wrex 3067   ∪ cun 3960  {csn 4630  {cpr 4632   “ cima 5691   Fn wfn 6557  ⟶wf 6558  –1-1→wf1 6559  –1-1-onto→wf1o 6561  ‘cfv 6562  (class class class)co 7430  0cc0 11152  1c1 11153  ℕ₀cn0 12523  ...cfz 13543  Vtxcvtx 29027  Edgcedg 29078   NeighbVtx cnbgr 29363   ClNeighbVtx cclnbgr 47742  StarGrcstgr 47853

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753  ax-cnex 11208  ax-resscn 11209  ax-1cn 11210  ax-icn 11211  ax-addcl 11212  ax-addrcl 11213  ax-mulcl 11214  ax-mulrcl 11215  ax-mulcom 11216  ax-addass 11217  ax-mulass 11218  ax-distr 11219  ax-i2m1 11220  ax-1ne0 11221  ax-1rid 11222  ax-rnegex 11223  ax-rrecex 11224  ax-cnre 11225  ax-pre-lttri 11226  ax-pre-lttrn 11227  ax-pre-ltadd 11228  ax-pre-mulgt0 11229

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7887  df-1st 8012  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-rdg 8448  df-1o 8504  df-oadd 8508  df-er 8743  df-en 8984  df-dom 8985  df-sdom 8986  df-fin 8987  df-dju 9938  df-card 9976  df-pnf 11294  df-mnf 11295  df-xr 11296  df-ltxr 11297  df-le 11298  df-sub 11491  df-neg 11492  df-nn 12264  df-2 12326  df-3 12327  df-4 12328  df-5 12329  df-6 12330  df-7 12331  df-8 12332  df-9 12333  df-n0 12524  df-xnn0 12597  df-z 12611  df-dec 12731  df-uz 12876  df-fz 13544  df-hash 14366  df-struct 17180  df-slot 17215  df-ndx 17227  df-base 17245  df-edgf 29018  df-vtx 29029  df-stgr 47854

This theorem is referenced by:  isubgr3stgrlem6  47873