Theorem upgrres1 29240

Description: A pseudograph obtained by removing one vertex and all edges incident with this vertex is a pseudograph. Remark: This graph is not a subgraph of the original graph in the sense of df-subgr 29195 since the domains of the edge functions may not be compatible. (Contributed by AV, 8-Nov-2020.)

Hypotheses

Ref	Expression
upgrres1.v	⊢ 𝑉 = (Vtx‘𝐺)
upgrres1.e	⊢ 𝐸 = (Edg‘𝐺)
upgrres1.f	⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒}
upgrres1.s	⊢ 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩

Assertion

Ref	Expression
upgrres1	⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ UPGraph)

Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁   𝑒,𝑉

Allowed substitution hints:   𝑆(𝑒)   𝐹(𝑒)

Proof of Theorem upgrres1

Dummy variables 𝑝 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oi 6838	. . . . 5 ⊢ ( I ↾ 𝐹):𝐹–1-1-onto→𝐹
2		f1of 6800	. . . . 5 ⊢ (( I ↾ 𝐹):𝐹–1-1-onto→𝐹 → ( I ↾ 𝐹):𝐹⟶𝐹)
3	1, 2	mp1i 13	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):𝐹⟶𝐹)
4	3	ffdmd 6718	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):dom ( I ↾ 𝐹)⟶𝐹)
5		upgrres1.f	. . . . 5 ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒}
6		simpr 484	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → 𝑒 ∈ 𝐸)
7	6	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑒 ∈ 𝐸)
8		upgrres1.e	. . . . . . . . . . . . 13 ⊢ 𝐸 = (Edg‘𝐺)
9	8	eleq2i 2820	. . . . . . . . . . . 12 ⊢ (𝑒 ∈ 𝐸 ↔ 𝑒 ∈ (Edg‘𝐺))
10		edgupgr 29061	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → (𝑒 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝑒 ≠ ∅ ∧ (♯‘𝑒) ≤ 2))
11		elpwi 4570	. . . . . . . . . . . . . . 15 ⊢ (𝑒 ∈ 𝒫 (Vtx‘𝐺) → 𝑒 ⊆ (Vtx‘𝐺))
12		upgrres1.v	. . . . . . . . . . . . . . 15 ⊢ 𝑉 = (Vtx‘𝐺)
13	11, 12	sseqtrrdi 3988	. . . . . . . . . . . . . 14 ⊢ (𝑒 ∈ 𝒫 (Vtx‘𝐺) → 𝑒 ⊆ 𝑉)
14	13	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ ((𝑒 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝑒 ≠ ∅ ∧ (♯‘𝑒) ≤ 2) → 𝑒 ⊆ 𝑉)
15	10, 14	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → 𝑒 ⊆ 𝑉)
16	9, 15	sylan2b 594	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑒 ∈ 𝐸) → 𝑒 ⊆ 𝑉)
17	16	ad4ant13 751	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑒 ⊆ 𝑉)
18		simpr 484	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑁 ∉ 𝑒)
19		elpwdifsn 4753	. . . . . . . . . 10 ⊢ ((𝑒 ∈ 𝐸 ∧ 𝑒 ⊆ 𝑉 ∧ 𝑁 ∉ 𝑒) → 𝑒 ∈ 𝒫 (𝑉 ∖ {𝑁}))
20	7, 17, 18, 19	syl3anc 1373	. . . . . . . . 9 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑒 ∈ 𝒫 (𝑉 ∖ {𝑁}))
21		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝐺 ∈ UPGraph)
22	9	biimpi 216	. . . . . . . . . . . 12 ⊢ (𝑒 ∈ 𝐸 → 𝑒 ∈ (Edg‘𝐺))
23	10	simp2d 1143	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → 𝑒 ≠ ∅)
24	21, 22, 23	syl2an 596	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → 𝑒 ≠ ∅)
25	24	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑒 ≠ ∅)
26		nelsn 4630	. . . . . . . . . 10 ⊢ (𝑒 ≠ ∅ → ¬ 𝑒 ∈ {∅})
27	25, 26	syl 17	. . . . . . . . 9 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → ¬ 𝑒 ∈ {∅})
28	20, 27	eldifd 3925	. . . . . . . 8 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) ∧ 𝑁 ∉ 𝑒) → 𝑒 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}))
29	28	ex 412	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → (𝑁 ∉ 𝑒 → 𝑒 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅})))
30	29	ralrimiva 3125	. . . . . 6 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑒 ∈ 𝐸 (𝑁 ∉ 𝑒 → 𝑒 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅})))
31		rabss 4035	. . . . . 6 ⊢ ({𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} ⊆ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ↔ ∀𝑒 ∈ 𝐸 (𝑁 ∉ 𝑒 → 𝑒 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅})))
32	30, 31	sylibr 234	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} ⊆ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}))
33	5, 32	eqsstrid 3985	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 ⊆ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}))
34		elrabi 3654	. . . . . . 7 ⊢ (𝑝 ∈ {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} → 𝑝 ∈ 𝐸)
35		edgval 28976	. . . . . . . . . . . 12 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
36	8, 35	eqtri 2752	. . . . . . . . . . 11 ⊢ 𝐸 = ran (iEdg‘𝐺)
37	36	eleq2i 2820	. . . . . . . . . 10 ⊢ (𝑝 ∈ 𝐸 ↔ 𝑝 ∈ ran (iEdg‘𝐺))
38		eqid 2729	. . . . . . . . . . . . 13 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
39	12, 38	upgrf 29013	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ UPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
40	39	frnd 6696	. . . . . . . . . . 11 ⊢ (𝐺 ∈ UPGraph → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
41	40	sseld 3945	. . . . . . . . . 10 ⊢ (𝐺 ∈ UPGraph → (𝑝 ∈ ran (iEdg‘𝐺) → 𝑝 ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
42	37, 41	biimtrid 242	. . . . . . . . 9 ⊢ (𝐺 ∈ UPGraph → (𝑝 ∈ 𝐸 → 𝑝 ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
43		fveq2 6858	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑝 → (♯‘𝑥) = (♯‘𝑝))
44	43	breq1d 5117	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑝 → ((♯‘𝑥) ≤ 2 ↔ (♯‘𝑝) ≤ 2))
45	44	elrab 3659	. . . . . . . . . 10 ⊢ (𝑝 ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ↔ (𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘𝑝) ≤ 2))
46	45	simprbi 496	. . . . . . . . 9 ⊢ (𝑝 ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (♯‘𝑝) ≤ 2)
47	42, 46	syl6 35	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → (𝑝 ∈ 𝐸 → (♯‘𝑝) ≤ 2))
48	47	adantr 480	. . . . . . 7 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝑝 ∈ 𝐸 → (♯‘𝑝) ≤ 2))
49	34, 48	syl5com 31	. . . . . 6 ⊢ (𝑝 ∈ {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} → ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (♯‘𝑝) ≤ 2))
50	49, 5	eleq2s 2846	. . . . 5 ⊢ (𝑝 ∈ 𝐹 → ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (♯‘𝑝) ≤ 2))
51	50	impcom 407	. . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑝 ∈ 𝐹) → (♯‘𝑝) ≤ 2)
52	33, 51	ssrabdv 4037	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
53	4, 52	fssd 6705	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ( I ↾ 𝐹):dom ( I ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
54		upgrres1.s	. . . 4 ⊢ 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩
55		opex 5424	. . . 4 ⊢ ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩ ∈ V
56	54, 55	eqeltri 2824	. . 3 ⊢ 𝑆 ∈ V
57	12, 8, 5, 54	upgrres1lem2 29238	. . . . 5 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁})
58	57	eqcomi 2738	. . . 4 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆)
59	12, 8, 5, 54	upgrres1lem3 29239	. . . . 5 ⊢ (iEdg‘𝑆) = ( I ↾ 𝐹)
60	59	eqcomi 2738	. . . 4 ⊢ ( I ↾ 𝐹) = (iEdg‘𝑆)
61	58, 60	isupgr 29011	. . 3 ⊢ (𝑆 ∈ V → (𝑆 ∈ UPGraph ↔ ( I ↾ 𝐹):dom ( I ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
62	56, 61	mp1i 13	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 ∈ UPGraph ↔ ( I ↾ 𝐹):dom ( I ↾ 𝐹)⟶{𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
63	53, 62	mpbird 257	1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 ∈ UPGraph)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925   ∉ wnel 3029  ∀wral 3044  {crab 3405  Vcvv 3447   ∖ cdif 3911   ⊆ wss 3914  ∅c0 4296  𝒫 cpw 4563  {csn 4589  ⟨cop 4595   class class class wbr 5107   I cid 5532  dom cdm 5638  ran crn 5639   ↾ cres 5640  ⟶wf 6507  –1-1-onto→wf1o 6510  ‘cfv 6511   ≤ cle 11209  2c2 12241  ♯chash 14295  Vtxcvtx 28923  iEdgciedg 28924  Edgcedg 28974  UPGraphcupgr 29007

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-1st 7968  df-2nd 7969  df-vtx 28925  df-iedg 28926  df-edg 28975  df-upgr 29009

This theorem is referenced by:  nbupgrres  29291