| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > vtxdeqd | GIF version | ||
| Description: Equality theorem for the vertex degree: If two graphs are structurally equal, their vertex degree functions are equal. (Contributed by AV, 26-Feb-2021.) |
| Ref | Expression |
|---|---|
| vtxdeqd.g | ⊢ (𝜑 → 𝐺 ∈ 𝑋) |
| vtxdeqd.h | ⊢ (𝜑 → 𝐻 ∈ 𝑌) |
| vtxdeqd.v | ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| vtxdeqd.i | ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| Ref | Expression |
|---|---|
| vtxdeqd | ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vtxdeqd.v | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) | |
| 2 | vtxdeqd.i | . . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) | |
| 3 | 2 | dmeqd 4985 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐻) = dom (iEdg‘𝐺)) |
| 4 | 2 | fveq1d 5700 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐺)‘𝑥)) |
| 5 | 4 | eleq2d 2308 | . . . . . 6 ⊢ (𝜑 → (𝑢 ∈ ((iEdg‘𝐻)‘𝑥) ↔ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 6 | 3, 5 | rabeqbidv 2816 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) |
| 7 | 6 | fveq2d 5702 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)})) |
| 8 | 4 | eqeq1d 2247 | . . . . . 6 ⊢ (𝜑 → (((iEdg‘𝐻)‘𝑥) = {𝑢} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑢})) |
| 9 | 3, 8 | rabeqbidv 2816 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}) |
| 10 | 9 | fveq2d 5702 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})) |
| 11 | 7, 10 | oveq12d 6106 | . . 3 ⊢ (𝜑 → ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))) |
| 12 | 1, 11 | mpteq12dv 4214 | . 2 ⊢ (𝜑 → (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 13 | vtxdeqd.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑌) | |
| 14 | eqid 2238 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 15 | eqid 2238 | . . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻) | |
| 16 | eqid 2238 | . . . 4 ⊢ dom (iEdg‘𝐻) = dom (iEdg‘𝐻) | |
| 17 | 14, 15, 16 | vtxdgfval 16734 | . . 3 ⊢ (𝐻 ∈ 𝑌 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})))) |
| 18 | 13, 17 | syl 14 | . 2 ⊢ (𝜑 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})))) |
| 19 | vtxdeqd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑋) | |
| 20 | eqid 2238 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 21 | eqid 2238 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 22 | eqid 2238 | . . . 4 ⊢ dom (iEdg‘𝐺) = dom (iEdg‘𝐺) | |
| 23 | 20, 21, 22 | vtxdgfval 16734 | . . 3 ⊢ (𝐺 ∈ 𝑋 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 24 | 19, 23 | syl 14 | . 2 ⊢ (𝜑 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 25 | 12, 18, 24 | 3eqtr4d 2281 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 {crab 2532 {csn 3709 ↦ cmpt 4193 dom cdm 4776 ‘cfv 5380 (class class class)co 6088 +e cxad 10189 ♯chash 11236 Vtxcvtx 16458 iEdgciedg 16459 VtxDegcvtxdg 16732 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-sub 8506 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-7 9377 df-8 9378 df-9 9379 df-n0 9575 df-dec 9789 df-ndx 13413 df-slot 13414 df-base 13416 df-edgf 16451 df-vtx 16460 df-iedg 16461 df-vtxdg 16733 |
| This theorem is used by: eupthvdres 16921 |
| Copyright terms: Public domain | W3C validator |