| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > setsiedg | Structured version Visualization version GIF version | ||
| Description: The (indexed) edges of a structure with a base set and an inserted resp. replaced slot for the edge function. (Contributed by AV, 7-Jun-2021.) (Revised by AV, 16-Nov-2021.) |
| Ref | Expression |
|---|---|
| setsvtx.i | ⊢ 𝐼 = (.ef‘ndx) |
| setsvtx.s | ⊢ (𝜑 → 𝐺 Struct 𝑋) |
| setsvtx.b | ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) |
| setsvtx.e | ⊢ (𝜑 → 𝐸 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| setsiedg | ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setsvtx.s | . . . 4 ⊢ (𝜑 → 𝐺 Struct 𝑋) | |
| 2 | fvexd 6897 | . . . 4 ⊢ (𝜑 → (.ef‘ndx) ∈ V) | |
| 3 | setsvtx.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 4 | 1, 2, 3 | setsn0fun 17233 | . . 3 ⊢ (𝜑 → Fun ((𝐺 sSet 〈(.ef‘ndx), 𝐸〉) ∖ {∅})) |
| 5 | setsvtx.b | . . . 4 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) | |
| 6 | 1, 2, 3, 5 | basprssdmsets 17281 | . . 3 ⊢ (𝜑 → {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) |
| 7 | funiedgval 29310 | . . 3 ⊢ ((Fun ((𝐺 sSet 〈(.ef‘ndx), 𝐸〉) ∖ {∅}) ∧ {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) → (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) | |
| 8 | 4, 6, 7 | syl2anc 595 | . 2 ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 9 | setsvtx.i | . . . . . 6 ⊢ 𝐼 = (.ef‘ndx) | |
| 10 | 9 | opeq1i 4845 | . . . . 5 ⊢ 〈𝐼, 𝐸〉 = 〈(.ef‘ndx), 𝐸〉 |
| 11 | 10 | oveq2i 7422 | . . . 4 ⊢ (𝐺 sSet 〈𝐼, 𝐸〉) = (𝐺 sSet 〈(.ef‘ndx), 𝐸〉) |
| 12 | 11 | fveq2i 6885 | . . 3 ⊢ (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) |
| 13 | 12 | a1i 11 | . 2 ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 14 | structex 17210 | . . . 4 ⊢ (𝐺 Struct 𝑋 → 𝐺 ∈ V) | |
| 15 | 1, 14 | syl 18 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 16 | edgfid 29281 | . . . 4 ⊢ .ef = Slot (.ef‘ndx) | |
| 17 | 16 | setsid 17267 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ 𝑊) → 𝐸 = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 18 | 15, 3, 17 | syl2anc 595 | . 2 ⊢ (𝜑 → 𝐸 = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 19 | 8, 13, 18 | 3eqtr4d 2814 | 1 ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∖ cdif 3910 ⊆ wss 3913 ∅c0 4294 {csn 4594 {cpr 4596 〈cop 4600 class class class wbr 5113 dom cdm 5662 Fun wfun 6531 ‘cfv 6537 (class class class)co 7411 Struct cstr 17206 sSet csts 17223 ndxcnx 17253 Basecbs 17269 .efcedgf 29279 iEdgciedg 29288 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-xnn0 12578 df-z 12592 df-dec 12712 df-uz 12863 df-fz 13536 df-hash 14367 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-edgf 29280 df-iedg 29290 |
| This theorem is referenced by: uhgrstrrepe 29369 usgrstrrepe 29526 structtocusgr 29737 |
| Copyright terms: Public domain | W3C validator |