| 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 13311 | . . . . 5 ⊢ (𝐺 Struct 𝑋 → 𝐺 ∈ V) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ V) |
| 4 | setsvtx.i | . . . . . 6 ⊢ 𝐼 = (.ef‘ndx) | |
| 5 | edgfndxnn 16132 | . . . . . 6 ⊢ (.ef‘ndx) ∈ ℕ | |
| 6 | 4, 5 | eqeltri 2307 | . . . . 5 ⊢ 𝐼 ∈ ℕ |
| 7 | 6 | a1i 9 | . . . 4 ⊢ (𝜑 → 𝐼 ∈ ℕ) |
| 8 | setsvtx.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 9 | setsex 13331 | . . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐼 ∈ ℕ ∧ 𝐸 ∈ 𝑊) → (𝐺 sSet 〈𝐼, 𝐸〉) ∈ V) | |
| 10 | 3, 7, 8, 9 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐺 sSet 〈𝐼, 𝐸〉) ∈ V) |
| 11 | 1, 7, 8 | setsn0fun 13336 | . . 3 ⊢ (𝜑 → Fun ((𝐺 sSet 〈𝐼, 𝐸〉) ∖ {∅})) |
| 12 | 4 | eqcomi 2238 | . . . . 5 ⊢ (.ef‘ndx) = 𝐼 |
| 13 | 12 | preq2i 3777 | . . . 4 ⊢ {(Base‘ndx), (.ef‘ndx)} = {(Base‘ndx), 𝐼} |
| 14 | setsvtx.b | . . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝐺) | |
| 15 | 1, 7, 8, 14 | bassetsnn 13356 | . . . 4 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝐺 sSet 〈𝐼, 𝐸〉)) |
| 16 | 13, 15 | eqsstrid 3288 | . . 3 ⊢ (𝜑 → {(Base‘ndx), (.ef‘ndx)} ⊆ dom (𝐺 sSet 〈𝐼, 𝐸〉)) |
| 17 | funvtxvalg 16160 | . . 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 13357 | . . . 4 ⊢ (Base = Slot (Base‘ndx) ∧ (Base‘ndx) ∈ ℕ) | |
| 20 | basendxnedgfndx 16135 | . . . . 5 ⊢ (Base‘ndx) ≠ (.ef‘ndx) | |
| 21 | 20, 4 | neeqtrri 2443 | . . . 4 ⊢ (Base‘ndx) ≠ 𝐼 |
| 22 | 19, 21, 6 | setsslnid 13351 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ 𝑊) → (Base‘𝐺) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) |
| 23 | 3, 8, 22 | syl2anc 411 | . 2 ⊢ (𝜑 → (Base‘𝐺) = (Base‘(𝐺 sSet 〈𝐼, 𝐸〉))) |
| 24 | 18, 23 | eqtr4d 2270 | 1 ⊢ (𝜑 → (Vtx‘(𝐺 sSet 〈𝐼, 𝐸〉)) = (Base‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ∖ cdif 3211 ⊆ wss 3214 ∅c0 3512 {csn 3694 {cpr 3695 〈cop 3697 class class class wbr 4114 dom cdm 4754 Fun wfun 5351 ‘cfv 5357 (class class class)co 6058 ℕcn 9257 Struct cstr 13295 ndxcnx 13296 sSet csts 13297 Basecbs 13299 .efcedgf 16128 Vtxcvtx 16136 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 |
| 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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-1o 6660 df-2o 6661 df-en 6989 df-dom 6990 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-5 9319 df-6 9320 df-7 9321 df-8 9322 df-9 9323 df-n0 9517 df-z 9598 df-dec 9731 df-struct 13301 df-ndx 13302 df-slot 13303 df-base 13305 df-sets 13306 df-edgf 16129 df-vtx 16138 |
| This theorem is referenced by: usgrstrrepeen 16355 |
| Copyright terms: Public domain | W3C validator |