![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > vtxdginducedm1lem4 | Structured version Visualization version GIF version |
Description: Lemma 4 for vtxdginducedm1 26891. (Contributed by AV, 17-Dec-2021.) |
Ref | Expression |
---|---|
vtxdginducedm1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
vtxdginducedm1.e | ⊢ 𝐸 = (iEdg‘𝐺) |
vtxdginducedm1.k | ⊢ 𝐾 = (𝑉 ∖ {𝑁}) |
vtxdginducedm1.i | ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} |
vtxdginducedm1.p | ⊢ 𝑃 = (𝐸 ↾ 𝐼) |
vtxdginducedm1.s | ⊢ 𝑆 = 〈𝐾, 𝑃〉 |
vtxdginducedm1.j | ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} |
Ref | Expression |
---|---|
vtxdginducedm1lem4 | ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6446 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (𝐸‘𝑖) = (𝐸‘𝑘)) | |
2 | 1 | eleq2d 2844 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑘))) |
3 | vtxdginducedm1.j | . . . . . . 7 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
4 | 2, 3 | elrab2 3575 | . . . . . 6 ⊢ (𝑘 ∈ 𝐽 ↔ (𝑘 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑘))) |
5 | eldifsn 4549 | . . . . . . . 8 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑊 ∈ 𝑉 ∧ 𝑊 ≠ 𝑁)) | |
6 | df-ne 2969 | . . . . . . . . 9 ⊢ (𝑊 ≠ 𝑁 ↔ ¬ 𝑊 = 𝑁) | |
7 | eleq2 2847 | . . . . . . . . . . . 12 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) ↔ 𝑁 ∈ {𝑊})) | |
8 | elsni 4414 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ {𝑊} → 𝑁 = 𝑊) | |
9 | 8 | eqcomd 2783 | . . . . . . . . . . . 12 ⊢ (𝑁 ∈ {𝑊} → 𝑊 = 𝑁) |
10 | 7, 9 | syl6bi 245 | . . . . . . . . . . 11 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) → 𝑊 = 𝑁)) |
11 | 10 | com12 32 | . . . . . . . . . 10 ⊢ (𝑁 ∈ (𝐸‘𝑘) → ((𝐸‘𝑘) = {𝑊} → 𝑊 = 𝑁)) |
12 | 11 | con3rr3 153 | . . . . . . . . 9 ⊢ (¬ 𝑊 = 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
13 | 6, 12 | sylbi 209 | . . . . . . . 8 ⊢ (𝑊 ≠ 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
14 | 5, 13 | simplbiim 500 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
15 | 14 | com12 32 | . . . . . 6 ⊢ (𝑁 ∈ (𝐸‘𝑘) → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
16 | 4, 15 | simplbiim 500 | . . . . 5 ⊢ (𝑘 ∈ 𝐽 → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
17 | 16 | impcom 398 | . . . 4 ⊢ ((𝑊 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑘 ∈ 𝐽) → ¬ (𝐸‘𝑘) = {𝑊}) |
18 | 17 | ralrimiva 3147 | . . 3 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) |
19 | rabeq0 4186 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅ ↔ ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) | |
20 | 18, 19 | sylibr 226 | . 2 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
21 | vtxdginducedm1.e | . . . . . . . 8 ⊢ 𝐸 = (iEdg‘𝐺) | |
22 | 21 | fvexi 6460 | . . . . . . 7 ⊢ 𝐸 ∈ V |
23 | 22 | dmex 7378 | . . . . . 6 ⊢ dom 𝐸 ∈ V |
24 | 23 | rabex 5049 | . . . . 5 ⊢ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} ∈ V |
25 | 3, 24 | eqeltri 2854 | . . . 4 ⊢ 𝐽 ∈ V |
26 | 25 | rabex 5049 | . . 3 ⊢ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V |
27 | hasheq0 13469 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V → ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅)) | |
28 | 26, 27 | ax-mp 5 | . 2 ⊢ ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
29 | 20, 28 | sylibr 226 | 1 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 = wceq 1601 ∈ wcel 2106 ≠ wne 2968 ∉ wnel 3074 ∀wral 3089 {crab 3093 Vcvv 3397 ∖ cdif 3788 ∅c0 4140 {csn 4397 〈cop 4403 dom cdm 5355 ↾ cres 5357 ‘cfv 6135 0cc0 10272 ♯chash 13435 Vtxcvtx 26344 iEdgciedg 26345 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2054 ax-8 2108 ax-9 2115 ax-10 2134 ax-11 2149 ax-12 2162 ax-13 2333 ax-ext 2753 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 ax-cnex 10328 ax-resscn 10329 ax-1cn 10330 ax-icn 10331 ax-addcl 10332 ax-addrcl 10333 ax-mulcl 10334 ax-mulrcl 10335 ax-mulcom 10336 ax-addass 10337 ax-mulass 10338 ax-distr 10339 ax-i2m1 10340 ax-1ne0 10341 ax-1rid 10342 ax-rnegex 10343 ax-rrecex 10344 ax-cnre 10345 ax-pre-lttri 10346 ax-pre-lttrn 10347 ax-pre-ltadd 10348 ax-pre-mulgt0 10349 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2550 df-eu 2586 df-clab 2763 df-cleq 2769 df-clel 2773 df-nfc 2920 df-ne 2969 df-nel 3075 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3399 df-sbc 3652 df-csb 3751 df-dif 3794 df-un 3796 df-in 3798 df-ss 3805 df-pss 3807 df-nul 4141 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-tp 4402 df-op 4404 df-uni 4672 df-int 4711 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-lim 5981 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-riota 6883 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-om 7344 df-1st 7445 df-2nd 7446 df-wrecs 7689 df-recs 7751 df-rdg 7789 df-1o 7843 df-er 8026 df-en 8242 df-dom 8243 df-sdom 8244 df-fin 8245 df-card 9098 df-pnf 10413 df-mnf 10414 df-xr 10415 df-ltxr 10416 df-le 10417 df-sub 10608 df-neg 10609 df-nn 11375 df-n0 11643 df-z 11729 df-uz 11993 df-fz 12644 df-hash 13436 |
This theorem is referenced by: vtxdginducedm1 26891 |
Copyright terms: Public domain | W3C validator |