| 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 886 | . . . 4 ⊢ (𝜑 → ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼})) |
| 3 | elun 4108 | . . . 4 ⊢ ((Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}) ↔ ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼})) | |
| 4 | 2, 3 | sylibr 237 | . . 3 ⊢ (𝜑 → (Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼})) |
| 5 | basprssdmsets.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑈) | |
| 6 | snidg 4627 | . . . . . 6 ⊢ (𝐼 ∈ 𝑈 → 𝐼 ∈ {𝐼}) | |
| 7 | 5, 6 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ {𝐼}) |
| 8 | 7 | olcd 887 | . . . 4 ⊢ (𝜑 → (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼})) |
| 9 | elun 4108 | . . . 4 ⊢ (𝐼 ∈ (dom 𝑆 ∪ {𝐼}) ↔ (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼})) | |
| 10 | 8, 9 | sylibr 237 | . . 3 ⊢ (𝜑 → 𝐼 ∈ (dom 𝑆 ∪ {𝐼})) |
| 11 | 4, 10 | prssd 4789 | . 2 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ (dom 𝑆 ∪ {𝐼})) |
| 12 | basprssdmsets.s | . . . 4 ⊢ (𝜑 → 𝑆 Struct 𝑋) | |
| 13 | structex 17211 | . . . 4 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V) | |
| 14 | 12, 13 | syl 18 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
| 15 | basprssdmsets.w | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑊) | |
| 16 | setsdm 17231 | . . 3 ⊢ ((𝑆 ∈ V ∧ 𝐸 ∈ 𝑊) → dom (𝑆 sSet 〈𝐼, 𝐸〉) = (dom 𝑆 ∪ {𝐼})) | |
| 17 | 14, 15, 16 | syl2anc 595 | . 2 ⊢ (𝜑 → dom (𝑆 sSet 〈𝐼, 𝐸〉) = (dom 𝑆 ∪ {𝐼})) |
| 18 | 11, 17 | sseqtrrd 3975 | 1 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet 〈𝐼, 𝐸〉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3904 ⊆ wss 3906 {csn 4590 {cpr 4592 〈cop 4596 class class class wbr 5110 dom cdm 5663 ‘cfv 6538 (class class class)co 7412 Struct cstr 17207 sSet csts 17224 ndxcnx 17254 Basecbs 17270 |
| 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 5258 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 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-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-res 5675 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-struct 17208 df-sets 17225 |
| This theorem is referenced by: setsvtx 29363 setsiedg 29364 |
| Copyright terms: Public domain | W3C validator |