| 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 29619. (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 6834 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (𝐸‘𝑖) = (𝐸‘𝑘)) | |
| 2 | 1 | eleq2d 2822 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑘))) |
| 3 | vtxdginducedm1.j | . . . . . . 7 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
| 4 | 2, 3 | elrab2 3649 | . . . . . 6 ⊢ (𝑘 ∈ 𝐽 ↔ (𝑘 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑘))) |
| 5 | eldifsn 4742 | . . . . . . . 8 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑊 ∈ 𝑉 ∧ 𝑊 ≠ 𝑁)) | |
| 6 | df-ne 2933 | . . . . . . . . 9 ⊢ (𝑊 ≠ 𝑁 ↔ ¬ 𝑊 = 𝑁) | |
| 7 | eleq2 2825 | . . . . . . . . . . . 12 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) ↔ 𝑁 ∈ {𝑊})) | |
| 8 | elsni 4597 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ {𝑊} → 𝑁 = 𝑊) | |
| 9 | 8 | eqcomd 2742 | . . . . . . . . . . . 12 ⊢ (𝑁 ∈ {𝑊} → 𝑊 = 𝑁) |
| 10 | 7, 9 | biimtrdi 253 | . . . . . . . . . . 11 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) → 𝑊 = 𝑁)) |
| 11 | 10 | com12 32 | . . . . . . . . . 10 ⊢ (𝑁 ∈ (𝐸‘𝑘) → ((𝐸‘𝑘) = {𝑊} → 𝑊 = 𝑁)) |
| 12 | 11 | con3rr3 155 | . . . . . . . . 9 ⊢ (¬ 𝑊 = 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
| 13 | 6, 12 | sylbi 217 | . . . . . . . 8 ⊢ (𝑊 ≠ 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
| 14 | 5, 13 | simplbiim 504 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
| 15 | 14 | com12 32 | . . . . . 6 ⊢ (𝑁 ∈ (𝐸‘𝑘) → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
| 16 | 4, 15 | simplbiim 504 | . . . . 5 ⊢ (𝑘 ∈ 𝐽 → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
| 17 | 16 | impcom 407 | . . . 4 ⊢ ((𝑊 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑘 ∈ 𝐽) → ¬ (𝐸‘𝑘) = {𝑊}) |
| 18 | 17 | ralrimiva 3128 | . . 3 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) |
| 19 | rabeq0 4340 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅ ↔ ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) | |
| 20 | 18, 19 | sylibr 234 | . 2 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
| 21 | vtxdginducedm1.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 22 | 21 | fvexi 6848 | . . . . 5 ⊢ 𝐸 ∈ V |
| 23 | 22 | dmex 7851 | . . . 4 ⊢ dom 𝐸 ∈ V |
| 24 | 3, 23 | rab2ex 5287 | . . 3 ⊢ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V |
| 25 | hasheq0 14288 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V → ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅)) | |
| 26 | 24, 25 | ax-mp 5 | . 2 ⊢ ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
| 27 | 20, 26 | sylibr 234 | 1 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∉ wnel 3036 ∀wral 3051 {crab 3399 Vcvv 3440 ∖ cdif 3898 ∅c0 4285 {csn 4580 〈cop 4586 dom cdm 5624 ↾ cres 5626 ‘cfv 6492 0cc0 11028 ♯chash 14255 Vtxcvtx 29071 iEdgciedg 29072 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-n0 12404 df-z 12491 df-uz 12754 df-fz 13426 df-hash 14256 |
| This theorem is referenced by: vtxdginducedm1 29619 |
| Copyright terms: Public domain | W3C validator |