| 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 6896 | . . . 4 ⊢ (𝜑 → (.ef‘ndx) ∈ V) | |
| 3 | setsvtx.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 4 | 1, 2, 3 | setsn0fun 17228 | . . 3 ⊢ (𝜑 → Fun ((𝐺 sSet 〈(.ef‘ndx), 𝐸〉) ∖ {∅})) |
| 5 | setsvtx.b | . . . 4 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) | |
| 6 | 1, 2, 3, 5 | basprssdmsets 17276 | . . 3 ⊢ (𝜑 → {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) |
| 7 | funiedgval 29369 | . . 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 4841 | . . . . 5 ⊢ 〈𝐼, 𝐸〉 = 〈(.ef‘ndx), 𝐸〉 |
| 11 | 10 | oveq2i 7421 | . . . 4 ⊢ (𝐺 sSet 〈𝐼, 𝐸〉) = (𝐺 sSet 〈(.ef‘ndx), 𝐸〉) |
| 12 | 11 | fveq2i 6884 | . . 3 ⊢ (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉)) |
| 13 | 12 | a1i 11 | . 2 ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (iEdg‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 14 | structex 17205 | . . . 4 ⊢ (𝐺 Struct 𝑋 → 𝐺 ∈ V) | |
| 15 | 1, 14 | syl 18 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 16 | edgfid 29340 | . . . 4 ⊢ .ef = Slot (.ef‘ndx) | |
| 17 | 16 | setsid 17262 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ 𝑊) → 𝐸 = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 18 | 15, 3, 17 | syl2anc 595 | . 2 ⊢ (𝜑 → 𝐸 = (.ef‘(𝐺 sSet 〈(.ef‘ndx), 𝐸〉))) |
| 19 | 8, 13, 18 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (iEdg‘(𝐺 sSet 〈𝐼, 𝐸〉)) = 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∖ cdif 3902 ⊆ wss 3905 ∅c0 4286 {csn 4589 {cpr 4591 〈cop 4595 class class class wbr 5109 dom cdm 5661 Fun wfun 6530 ‘cfv 6536 (class class class)co 7410 Struct cstr 17201 sSet csts 17218 ndxcnx 17248 Basecbs 17264 .efcedgf 29338 iEdgciedg 29347 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-3 12299 df-4 12300 df-5 12301 df-6 12302 df-7 12303 df-8 12304 df-9 12305 df-n0 12500 df-xnn0 12573 df-z 12587 df-dec 12707 df-uz 12858 df-fz 13531 df-hash 14363 df-struct 17202 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-edgf 29339 df-iedg 29349 |
| This theorem is referenced by: uhgrstrrepe 29428 usgrstrrepe 29585 structtocusgr 29796 |
| Copyright terms: Public domain | W3C validator |