| 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 4958 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐻) = dom (iEdg‘𝐺)) |
| 4 | 2 | fveq1d 5672 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐺)‘𝑥)) |
| 5 | 4 | eleq2d 2302 | . . . . . 6 ⊢ (𝜑 → (𝑢 ∈ ((iEdg‘𝐻)‘𝑥) ↔ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 6 | 3, 5 | rabeqbidv 2808 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) |
| 7 | 6 | fveq2d 5674 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)})) |
| 8 | 4 | eqeq1d 2241 | . . . . . 6 ⊢ (𝜑 → (((iEdg‘𝐻)‘𝑥) = {𝑢} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑢})) |
| 9 | 3, 8 | rabeqbidv 2808 | . . . . 5 ⊢ (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}) |
| 10 | 9 | fveq2d 5674 | . . . 4 ⊢ (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})) |
| 11 | 7, 10 | oveq12d 6068 | . . 3 ⊢ (𝜑 → ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))) |
| 12 | 1, 11 | mpteq12dv 4192 | . 2 ⊢ (𝜑 → (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))) |
| 13 | vtxdeqd.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑌) | |
| 14 | eqid 2232 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 15 | eqid 2232 | . . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻) | |
| 16 | eqid 2232 | . . . 4 ⊢ dom (iEdg‘𝐻) = dom (iEdg‘𝐻) | |
| 17 | 14, 15, 16 | vtxdgfval 16283 | . . 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 2232 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 21 | eqid 2232 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 22 | eqid 2232 | . . . 4 ⊢ dom (iEdg‘𝐺) = dom (iEdg‘𝐺) | |
| 23 | 20, 21, 22 | vtxdgfval 16283 | . . 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 2275 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 {crab 2524 {csn 3689 ↦ cmpt 4171 dom cdm 4749 ‘cfv 5352 (class class class)co 6050 +𝑒 cxad 10103 ♯chash 11138 Vtxcvtx 16007 iEdgciedg 16008 VtxDegcvtxdg 16281 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-sub 8446 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-5 9299 df-6 9300 df-7 9301 df-8 9302 df-9 9303 df-n0 9497 df-dec 9710 df-ndx 13215 df-slot 13216 df-base 13218 df-edgf 16000 df-vtx 16009 df-iedg 16010 df-vtxdg 16282 |
| This theorem is referenced by: eupthvdres 16470 |
| Copyright terms: Public domain | W3C validator |