![]() |
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 29065. (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 6892 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (𝐸‘𝑖) = (𝐸‘𝑘)) | |
2 | 1 | eleq2d 2817 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑘))) |
3 | vtxdginducedm1.j | . . . . . . 7 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
4 | 2, 3 | elrab2 3687 | . . . . . 6 ⊢ (𝑘 ∈ 𝐽 ↔ (𝑘 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑘))) |
5 | eldifsn 4791 | . . . . . . . 8 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑊 ∈ 𝑉 ∧ 𝑊 ≠ 𝑁)) | |
6 | df-ne 2939 | . . . . . . . . 9 ⊢ (𝑊 ≠ 𝑁 ↔ ¬ 𝑊 = 𝑁) | |
7 | eleq2 2820 | . . . . . . . . . . . 12 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) ↔ 𝑁 ∈ {𝑊})) | |
8 | elsni 4646 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ {𝑊} → 𝑁 = 𝑊) | |
9 | 8 | eqcomd 2736 | . . . . . . . . . . . 12 ⊢ (𝑁 ∈ {𝑊} → 𝑊 = 𝑁) |
10 | 7, 9 | syl6bi 252 | . . . . . . . . . . 11 ⊢ ((𝐸‘𝑘) = {𝑊} → (𝑁 ∈ (𝐸‘𝑘) → 𝑊 = 𝑁)) |
11 | 10 | com12 32 | . . . . . . . . . 10 ⊢ (𝑁 ∈ (𝐸‘𝑘) → ((𝐸‘𝑘) = {𝑊} → 𝑊 = 𝑁)) |
12 | 11 | con3rr3 155 | . . . . . . . . 9 ⊢ (¬ 𝑊 = 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
13 | 6, 12 | sylbi 216 | . . . . . . . 8 ⊢ (𝑊 ≠ 𝑁 → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
14 | 5, 13 | simplbiim 503 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (𝐸‘𝑘) → ¬ (𝐸‘𝑘) = {𝑊})) |
15 | 14 | com12 32 | . . . . . 6 ⊢ (𝑁 ∈ (𝐸‘𝑘) → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
16 | 4, 15 | simplbiim 503 | . . . . 5 ⊢ (𝑘 ∈ 𝐽 → (𝑊 ∈ (𝑉 ∖ {𝑁}) → ¬ (𝐸‘𝑘) = {𝑊})) |
17 | 16 | impcom 406 | . . . 4 ⊢ ((𝑊 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑘 ∈ 𝐽) → ¬ (𝐸‘𝑘) = {𝑊}) |
18 | 17 | ralrimiva 3144 | . . 3 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) |
19 | rabeq0 4385 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅ ↔ ∀𝑘 ∈ 𝐽 ¬ (𝐸‘𝑘) = {𝑊}) | |
20 | 18, 19 | sylibr 233 | . 2 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
21 | vtxdginducedm1.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
22 | 21 | fvexi 6906 | . . . . 5 ⊢ 𝐸 ∈ V |
23 | 22 | dmex 7906 | . . . 4 ⊢ dom 𝐸 ∈ V |
24 | 3, 23 | rab2ex 5336 | . . 3 ⊢ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V |
25 | hasheq0 14329 | . . 3 ⊢ ({𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} ∈ V → ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅)) | |
26 | 24, 25 | ax-mp 5 | . 2 ⊢ ((♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0 ↔ {𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}} = ∅) |
27 | 20, 26 | sylibr 233 | 1 ⊢ (𝑊 ∈ (𝑉 ∖ {𝑁}) → (♯‘{𝑘 ∈ 𝐽 ∣ (𝐸‘𝑘) = {𝑊}}) = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∉ wnel 3044 ∀wral 3059 {crab 3430 Vcvv 3472 ∖ cdif 3946 ∅c0 4323 {csn 4629 ⟨cop 4635 dom cdm 5677 ↾ cres 5679 ‘cfv 6544 0cc0 11114 ♯chash 14296 Vtxcvtx 28521 iEdgciedg 28522 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-er 8707 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-card 9938 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-n0 12479 df-z 12565 df-uz 12829 df-fz 13491 df-hash 14297 |
This theorem is referenced by: vtxdginducedm1 29065 |
Copyright terms: Public domain | W3C validator |