Theorem cusgrfilem2 29489

Description: Lemma 2 for cusgrfi 29491. (Contributed by Alexander van der Vekens, 13-Jan-2018.) (Revised by AV, 11-Nov-2020.)

Hypotheses

Ref	Expression
cusgrfi.v	⊢ 𝑉 = (Vtx‘𝐺)
cusgrfi.p	⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁})}
cusgrfi.f	⊢ 𝐹 = (𝑥 ∈ (𝑉 ∖ {𝑁}) ↦ {𝑥, 𝑁})

Assertion

Ref	Expression
cusgrfilem2	⊢ (𝑁 ∈ 𝑉 → 𝐹:(𝑉 ∖ {𝑁})–1-1-onto→𝑃)

Distinct variable groups:   𝑥,𝐺   𝑁,𝑎,𝑥   𝑉,𝑎,𝑥   𝑥,𝑃

Allowed substitution hints:   𝑃(𝑎)   𝐹(𝑥,𝑎)   𝐺(𝑎)

Proof of Theorem cusgrfilem2

Dummy variables 𝑒 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifi 4141	. . . . 5 ⊢ (𝑥 ∈ (𝑉 ∖ {𝑁}) → 𝑥 ∈ 𝑉)
2		id 22	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ 𝑉)
3		prelpwi 5458	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) → {𝑥, 𝑁} ∈ 𝒫 𝑉)
4	1, 2, 3	syl2anr 597	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → {𝑥, 𝑁} ∈ 𝒫 𝑉)
5	1	adantl 481	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑥 ∈ 𝑉)
6		eldifsni 4795	. . . . . . 7 ⊢ (𝑥 ∈ (𝑉 ∖ {𝑁}) → 𝑥 ≠ 𝑁)
7	6	adantl 481	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑥 ≠ 𝑁)
8		eqidd 2736	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → {𝑥, 𝑁} = {𝑥, 𝑁})
9	7, 8	jca 511	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑥 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑥, 𝑁}))
10		id 22	. . . . . 6 ⊢ (𝑥 ∈ 𝑉 → 𝑥 ∈ 𝑉)
11		neeq1 3001	. . . . . . . 8 ⊢ (𝑎 = 𝑥 → (𝑎 ≠ 𝑁 ↔ 𝑥 ≠ 𝑁))
12		preq1 4738	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → {𝑎, 𝑁} = {𝑥, 𝑁})
13	12	eqeq2d 2746	. . . . . . . 8 ⊢ (𝑎 = 𝑥 → ({𝑥, 𝑁} = {𝑎, 𝑁} ↔ {𝑥, 𝑁} = {𝑥, 𝑁}))
14	11, 13	anbi12d 632	. . . . . . 7 ⊢ (𝑎 = 𝑥 → ((𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁}) ↔ (𝑥 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑥, 𝑁})))
15	14	adantl 481	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑎 = 𝑥) → ((𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁}) ↔ (𝑥 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑥, 𝑁})))
16	10, 15	rspcedv 3615	. . . . 5 ⊢ (𝑥 ∈ 𝑉 → ((𝑥 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑥, 𝑁}) → ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁})))
17	5, 9, 16	sylc 65	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁}))
18		cusgrfi.p	. . . . . 6 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁})}
19	18	eleq2i 2831	. . . . 5 ⊢ ({𝑥, 𝑁} ∈ 𝑃 ↔ {𝑥, 𝑁} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁})})
20		eqeq1 2739	. . . . . . . 8 ⊢ (𝑣 = {𝑥, 𝑁} → (𝑣 = {𝑎, 𝑁} ↔ {𝑥, 𝑁} = {𝑎, 𝑁}))
21	20	anbi2d 630	. . . . . . 7 ⊢ (𝑣 = {𝑥, 𝑁} → ((𝑎 ≠ 𝑁 ∧ 𝑣 = {𝑎, 𝑁}) ↔ (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁})))
22	21	rexbidv 3177	. . . . . 6 ⊢ (𝑣 = {𝑥, 𝑁} → (∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑣 = {𝑎, 𝑁}) ↔ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁})))
23		eqeq1 2739	. . . . . . . . 9 ⊢ (𝑥 = 𝑣 → (𝑥 = {𝑎, 𝑁} ↔ 𝑣 = {𝑎, 𝑁}))
24	23	anbi2d 630	. . . . . . . 8 ⊢ (𝑥 = 𝑣 → ((𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁}) ↔ (𝑎 ≠ 𝑁 ∧ 𝑣 = {𝑎, 𝑁})))
25	24	rexbidv 3177	. . . . . . 7 ⊢ (𝑥 = 𝑣 → (∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁}) ↔ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑣 = {𝑎, 𝑁})))
26	25	cbvrabv 3444	. . . . . 6 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁})} = {𝑣 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑣 = {𝑎, 𝑁})}
27	22, 26	elrab2 3698	. . . . 5 ⊢ ({𝑥, 𝑁} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁})} ↔ ({𝑥, 𝑁} ∈ 𝒫 𝑉 ∧ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁})))
28	19, 27	bitri 275	. . . 4 ⊢ ({𝑥, 𝑁} ∈ 𝑃 ↔ ({𝑥, 𝑁} ∈ 𝒫 𝑉 ∧ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ {𝑥, 𝑁} = {𝑎, 𝑁})))
29	4, 17, 28	sylanbrc 583	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → {𝑥, 𝑁} ∈ 𝑃)
30	29	ralrimiva 3144	. 2 ⊢ (𝑁 ∈ 𝑉 → ∀𝑥 ∈ (𝑉 ∖ {𝑁}){𝑥, 𝑁} ∈ 𝑃)
31		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}) → 𝑎 ≠ 𝑁)
32	31	anim2i 617	. . . . . . . . . 10 ⊢ ((𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) → (𝑎 ∈ 𝑉 ∧ 𝑎 ≠ 𝑁))
33	32	adantl 481	. . . . . . . . 9 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) → (𝑎 ∈ 𝑉 ∧ 𝑎 ≠ 𝑁))
34		eldifsn 4791	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑎 ∈ 𝑉 ∧ 𝑎 ≠ 𝑁))
35	33, 34	sylibr 234	. . . . . . . 8 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) → 𝑎 ∈ (𝑉 ∖ {𝑁}))
36		eqeq1 2739	. . . . . . . . . . . . . 14 ⊢ (𝑒 = {𝑎, 𝑁} → (𝑒 = {𝑥, 𝑁} ↔ {𝑎, 𝑁} = {𝑥, 𝑁}))
37	36	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}) → (𝑒 = {𝑥, 𝑁} ↔ {𝑎, 𝑁} = {𝑥, 𝑁}))
38	37	ad2antlr 727	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑒 = {𝑥, 𝑁} ↔ {𝑎, 𝑁} = {𝑥, 𝑁}))
39		vex 3482	. . . . . . . . . . . . . 14 ⊢ 𝑎 ∈ V
40		vex 3482	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
41	39, 40	preqr1 4853	. . . . . . . . . . . . 13 ⊢ ({𝑎, 𝑁} = {𝑥, 𝑁} → 𝑎 = 𝑥)
42	41	equcomd 2016	. . . . . . . . . . . 12 ⊢ ({𝑎, 𝑁} = {𝑥, 𝑁} → 𝑥 = 𝑎)
43	38, 42	biimtrdi 253	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑒 = {𝑥, 𝑁} → 𝑥 = 𝑎))
44	43	adantll 714	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑒 = {𝑥, 𝑁} → 𝑥 = 𝑎))
45	12	equcoms 2017	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑎 → {𝑎, 𝑁} = {𝑥, 𝑁})
46	45	eqeq2d 2746	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → (𝑒 = {𝑎, 𝑁} ↔ 𝑒 = {𝑥, 𝑁}))
47	46	biimpcd 249	. . . . . . . . . . . . 13 ⊢ (𝑒 = {𝑎, 𝑁} → (𝑥 = 𝑎 → 𝑒 = {𝑥, 𝑁}))
48	47	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}) → (𝑥 = 𝑎 → 𝑒 = {𝑥, 𝑁}))
49	48	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) → (𝑥 = 𝑎 → 𝑒 = {𝑥, 𝑁}))
50	49	ad2antlr 727	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑥 = 𝑎 → 𝑒 = {𝑥, 𝑁}))
51	44, 50	impbid 212	. . . . . . . . 9 ⊢ ((((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎))
52	51	ralrimiva 3144	. . . . . . . 8 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) → ∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎))
53	35, 52	jca 511	. . . . . . 7 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) ∧ (𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}))) → (𝑎 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎)))
54	53	ex 412	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) → ((𝑎 ∈ 𝑉 ∧ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) → (𝑎 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎))))
55	54	reximdv2 3162	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑒 ∈ 𝒫 𝑉) → (∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁}) → ∃𝑎 ∈ (𝑉 ∖ {𝑁})∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎)))
56	55	expimpd 453	. . . 4 ⊢ (𝑁 ∈ 𝑉 → ((𝑒 ∈ 𝒫 𝑉 ∧ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})) → ∃𝑎 ∈ (𝑉 ∖ {𝑁})∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎)))
57		eqeq1 2739	. . . . . . 7 ⊢ (𝑥 = 𝑒 → (𝑥 = {𝑎, 𝑁} ↔ 𝑒 = {𝑎, 𝑁}))
58	57	anbi2d 630	. . . . . 6 ⊢ (𝑥 = 𝑒 → ((𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁}) ↔ (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})))
59	58	rexbidv 3177	. . . . 5 ⊢ (𝑥 = 𝑒 → (∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑥 = {𝑎, 𝑁}) ↔ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})))
60	59, 18	elrab2 3698	. . . 4 ⊢ (𝑒 ∈ 𝑃 ↔ (𝑒 ∈ 𝒫 𝑉 ∧ ∃𝑎 ∈ 𝑉 (𝑎 ≠ 𝑁 ∧ 𝑒 = {𝑎, 𝑁})))
61		reu6 3735	. . . 4 ⊢ (∃!𝑥 ∈ (𝑉 ∖ {𝑁})𝑒 = {𝑥, 𝑁} ↔ ∃𝑎 ∈ (𝑉 ∖ {𝑁})∀𝑥 ∈ (𝑉 ∖ {𝑁})(𝑒 = {𝑥, 𝑁} ↔ 𝑥 = 𝑎))
62	56, 60, 61	3imtr4g 296	. . 3 ⊢ (𝑁 ∈ 𝑉 → (𝑒 ∈ 𝑃 → ∃!𝑥 ∈ (𝑉 ∖ {𝑁})𝑒 = {𝑥, 𝑁}))
63	62	ralrimiv 3143	. 2 ⊢ (𝑁 ∈ 𝑉 → ∀𝑒 ∈ 𝑃 ∃!𝑥 ∈ (𝑉 ∖ {𝑁})𝑒 = {𝑥, 𝑁})
64		cusgrfi.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ (𝑉 ∖ {𝑁}) ↦ {𝑥, 𝑁})
65	64	f1ompt 7131	. 2 ⊢ (𝐹:(𝑉 ∖ {𝑁})–1-1-onto→𝑃 ↔ (∀𝑥 ∈ (𝑉 ∖ {𝑁}){𝑥, 𝑁} ∈ 𝑃 ∧ ∀𝑒 ∈ 𝑃 ∃!𝑥 ∈ (𝑉 ∖ {𝑁})𝑒 = {𝑥, 𝑁}))
66	30, 63, 65	sylanbrc 583	1 ⊢ (𝑁 ∈ 𝑉 → 𝐹:(𝑉 ∖ {𝑁})–1-1-onto→𝑃)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106   ≠ wne 2938  ∀wral 3059  ∃wrex 3068  ∃!wreu 3376  {crab 3433   ∖ cdif 3960  𝒫 cpw 4605  {csn 4631  {cpr 4633   ↦ cmpt 5231  –1-1-onto→wf1o 6562  ‘cfv 6563  Vtxcvtx 29028

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570

This theorem is referenced by:  cusgrfilem3  29490