| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > basprssdmsets | Structured version Visualization version GIF version | ||
| Description: The pair of the base index and another index is a subset of the domain of the structure obtained by replacing/adding a slot at the other index in a structure having a base slot. (Contributed by AV, 7-Jun-2021.) (Revised by AV, 16-Nov-2021.) |
| Ref | Expression |
|---|---|
| basprssdmsets.s | ⊢ (𝜑 → 𝑆 Struct 𝑋) |
| basprssdmsets.i | ⊢ (𝜑 → 𝐼 ∈ 𝑈) |
| basprssdmsets.w | ⊢ (𝜑 → 𝐸 ∈ 𝑊) |
| basprssdmsets.b | ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑆) |
| Ref | Expression |
|---|---|
| basprssdmsets | ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet 〈𝐼, 𝐸〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | basprssdmsets.b | . . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑆) | |
| 2 | 1 | orcd 879 | . . . 4 ⊢ (𝜑 → ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼})) |
| 3 | elun 4090 | . . . 4 ⊢ ((Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}) ↔ ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼})) | |
| 4 | 2, 3 | sylibr 235 | . . 3 ⊢ (𝜑 → (Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼})) |
| 5 | basprssdmsets.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑈) | |
| 6 | snidg 4599 | . . . . . 6 ⊢ (𝐼 ∈ 𝑈 → 𝐼 ∈ {𝐼}) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ {𝐼}) |
| 8 | 7 | olcd 880 | . . . 4 ⊢ (𝜑 → (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼})) |
| 9 | elun 4090 | . . . 4 ⊢ (𝐼 ∈ (dom 𝑆 ∪ {𝐼}) ↔ (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼})) | |
| 10 | 8, 9 | sylibr 235 | . . 3 ⊢ (𝜑 → 𝐼 ∈ (dom 𝑆 ∪ {𝐼})) |
| 11 | 4, 10 | prssd 4760 | . 2 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ (dom 𝑆 ∪ {𝐼})) |
| 12 | basprssdmsets.s | . . . 4 ⊢ (𝜑 → 𝑆 Struct 𝑋) | |
| 13 | structex 17118 | . . . 4 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V) | |
| 14 | 12, 13 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
| 15 | basprssdmsets.w | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 16 | setsdm 17138 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐸 ∈ 𝑊) → dom (𝑆 sSet 〈𝐼, 𝐸〉) = (dom 𝑆 ∪ {𝐼})) | |
| 17 | 14, 15, 16 | syl2anc 590 | . 2 ⊢ (𝜑 → dom (𝑆 sSet 〈𝐼, 𝐸〉) = (dom 𝑆 ∪ {𝐼})) |
| 18 | 11, 17 | sseqtrrd 3959 | 1 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet 〈𝐼, 𝐸〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 853 = wceq 1547 ∈ wcel 2119 Vcvv 3432 ∪ cun 3888 ⊆ wss 3890 {csn 4562 {cpr 4564 〈cop 4568 class class class wbr 5079 dom cdm 5625 ‘cfv 6492 (class class class)co 7363 Struct cstr 17114 sSet csts 17131 ndxcnx 17161 Basecbs 17177 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-res 5637 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-struct 17115 df-sets 17132 |
| This theorem is referenced by: setsvtx 29129 setsiedg 29130 |
| Copyright terms: Public domain | W3C validator |