| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > setsvtx | GIF version | ||
| Description: The vertices of a structure with a base set and an inserted resp. replaced slot for the edge function. (Contributed by AV, 18-Jan-2020.) (Revised by AV, 16-Nov-2021.) |
| Ref | Expression |
|---|---|
| setsvtx.i | ⊢ 𝐼 = (.ef‘ndx) |
| setsvtx.s | ⊢ (𝜑 → 𝐺 Struct 𝑋) |
| setsvtx.b | ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) |
| setsvtx.e | ⊢ (𝜑 → 𝐸 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| setsvtx | ⊢ (𝜑 → (Vtx‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (Base‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setsvtx.s | . . . . 5 ⊢ (𝜑 → 𝐺 Struct 𝑋) | |
| 2 | structex 13213 | . . . . 5 ⊢ (𝐺 Struct 𝑋 → 𝐺 ∈ V) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ V) |
| 4 | setsvtx.i | . . . . . 6 ⊢ 𝐼 = (.ef‘ndx) | |
| 5 | edgfndxnn 15990 | . . . . . 6 ⊢ (.ef‘ndx) ∈ ℕ | |
| 6 | 4, 5 | eqeltri 2305 | . . . . 5 ⊢ 𝐼 ∈ ℕ |
| 7 | 6 | a1i 9 | . . . 4 ⊢ (𝜑 → 𝐼 ∈ ℕ) |
| 8 | setsvtx.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 9 | setsex 13233 | . . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐼 ∈ ℕ ∧ 𝐸 ∈ 𝑊) → (𝐺 sSet 〈𝐼, 𝐸〉) ∈ V) | |
| 10 | 3, 7, 8, 9 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐺 sSet 〈𝐼, 𝐸〉) ∈ V) |
| 11 | 1, 7, 8 | setsn0fun 13238 | . . 3 ⊢ (𝜑 → Fun ((𝐺 sSet 〈𝐼, 𝐸〉) ∖ {∅})) |
| 12 | 4 | eqcomi 2236 | . . . . 5 ⊢ (.ef‘ndx) = 𝐼 |
| 13 | 12 | preq2i 3771 | . . . 4 ⊢ {(Base‘ndx), (.ef‘ndx)} = {(Base‘ndx), 𝐼} |
| 14 | setsvtx.b | . . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) | |
| 15 | 1, 7, 8, 14 | bassetsnn 13258 | . . . 4 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝐺 sSet 〈𝐼, 𝐸〉)) |
| 16 | 13, 15 | eqsstrid 3283 | . . 3 ⊢ (𝜑 → {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈𝐼, 𝐸〉)) |
| 17 | funvtxvalg 16018 | . . 3 ⊢ (((𝐺 sSet 〈𝐼, 𝐸〉) ∈ V ∧ Fun ((𝐺 sSet 〈𝐼, 𝐸〉) ∖ {∅}) ∧ {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈𝐼, 𝐸〉)) → (Vtx‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) | |
| 18 | 10, 11, 16, 17 | syl3anc 1274 | . 2 ⊢ (𝜑 → (Vtx‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) |
| 19 | baseslid 13259 | . . . 4 ⊢ (Base = Slot (Base‘ndx) ∧ (Base‘ndx) ∈ ℕ) | |
| 20 | basendxnedgfndx 15993 | . . . . 5 ⊢ (Base‘ndx) ≠ (.ef‘ndx) | |
| 21 | 20, 4 | neeqtrri 2441 | . . . 4 ⊢ (Base‘ndx) ≠ 𝐼 |
| 22 | 19, 21, 6 | setsslnid 13253 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ 𝑊) → (Base‘𝐺) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) |
| 23 | 3, 8, 22 | syl2anc 411 | . 2 ⊢ (𝜑 → (Base‘𝐺) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) |
| 24 | 18, 23 | eqtr4d 2268 | 1 ⊢ (𝜑 → (Vtx‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (Base‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 Vcvv 2812 ∖ cdif 3207 ⊆ wss 3210 ∅c0 3507 {csn 3688 {cpr 3689 〈cop 3691 class class class wbr 4108 dom cdm 4748 Fun wfun 5345 ‘cfv 5351 (class class class)co 6049 ℕcn 9233 Struct cstr 13197 ndxcnx 13198 sSet csts 13199 Basecbs 13201 .efcedgf 15986 Vtxcvtx 15994 |
| 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-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-mulrcl 8222 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-precex 8233 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-ltadd 8239 ax-pre-mulgt0 8240 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 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-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-suc 4491 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-1o 6646 df-2o 6647 df-en 6975 df-dom 6976 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-5 9295 df-6 9296 df-7 9297 df-8 9298 df-9 9299 df-n0 9493 df-z 9574 df-dec 9706 df-struct 13203 df-ndx 13204 df-slot 13205 df-base 13207 df-sets 13208 df-edgf 15987 df-vtx 15996 |
| This theorem is referenced by: usgrstrrepeen 16213 |
| Copyright terms: Public domain | W3C validator |