| 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 4925 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐻) = dom (iEdg‘𝐺)) |
| 4 | 2 | fveq1d 5631 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐺)‘𝑥)) |
| 5 | 4 | eleq2d 2299 | . . . . . 6 ⊢ (𝜑 → (𝑢 ∈ ((iEdg‘𝐻)‘𝑥) ↔ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 6 | 3, 5 | rabeqbidv 2794 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) |
| 7 | 6 | fveq2d 5633 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)})) |
| 8 | 4 | eqeq1d 2238 | . . . . . 6 ⊢ (𝜑 → (((iEdg‘𝐻)‘𝑥) = {𝑢} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑢})) |
| 9 | 3, 8 | rabeqbidv 2794 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}) |
| 10 | 9 | fveq2d 5633 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})) |
| 11 | 7, 10 | oveq12d 6025 | . . 3 ⊢ (𝜑 → ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))) |
| 12 | 1, 11 | mpteq12dv 4166 | . 2 ⊢ (𝜑 → (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 13 | vtxdeqd.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑌) | |
| 14 | eqid 2229 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 15 | eqid 2229 | . . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻) | |
| 16 | eqid 2229 | . . . 4 ⊢ dom (iEdg‘𝐻) = dom (iEdg‘𝐻) | |
| 17 | 14, 15, 16 | vtxdgfval 16047 | . . 3 ⊢ (𝐻 ∈ 𝑌 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})))) |
| 18 | 13, 17 | syl 14 | . 2 ⊢ (𝜑 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})))) |
| 19 | vtxdeqd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑋) | |
| 20 | eqid 2229 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 21 | eqid 2229 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 22 | eqid 2229 | . . . 4 ⊢ dom (iEdg‘𝐺) = dom (iEdg‘𝐺) | |
| 23 | 20, 21, 22 | vtxdgfval 16047 | . . 3 ⊢ (𝐺 ∈ 𝑋 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 24 | 19, 23 | syl 14 | . 2 ⊢ (𝜑 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 25 | 12, 18, 24 | 3eqtr4d 2272 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 {crab 2512 {csn 3666 ↦ cmpt 4145 dom cdm 4719 ‘cfv 5318 (class class class)co 6007 +𝑒 cxad 9978 ♯chash 11009 Vtxcvtx 15828 iEdgciedg 15829 VtxDegcvtxdg 16045 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-sub 8330 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-5 9183 df-6 9184 df-7 9185 df-8 9186 df-9 9187 df-n0 9381 df-dec 9590 df-ndx 13050 df-slot 13051 df-base 13053 df-edgf 15821 df-vtx 15830 df-iedg 15831 df-vtxdg 16046 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |