Theorem basprssdmsets 17191

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.)

Hypotheses

Ref	Expression
basprssdmsets.s	⊢ (𝜑 → 𝑆 Struct 𝑋)
basprssdmsets.i	⊢ (𝜑 → 𝐼 ∈ 𝑈)
basprssdmsets.w	⊢ (𝜑 → 𝐸 ∈ 𝑊)
basprssdmsets.b	⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑆)

Assertion

Ref	Expression
basprssdmsets	⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))

Proof of Theorem basprssdmsets

Step	Hyp	Ref	Expression
1		basprssdmsets.b	. . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑆)
2	1	orcd 874	. . . 4 ⊢ (𝜑 → ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
3		elun 4093	. . . 4 ⊢ ((Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}) ↔ ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
4	2, 3	sylibr 234	. . 3 ⊢ (𝜑 → (Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}))
5		basprssdmsets.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑈)
6		snidg 4604	. . . . . 6 ⊢ (𝐼 ∈ 𝑈 → 𝐼 ∈ {𝐼})
7	5, 6	syl 17	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ {𝐼})
8	7	olcd 875	. . . 4 ⊢ (𝜑 → (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼}))
9		elun 4093	. . . 4 ⊢ (𝐼 ∈ (dom 𝑆 ∪ {𝐼}) ↔ (𝐼 ∈ dom 𝑆 ∨ 𝐼 ∈ {𝐼}))
10	8, 9	sylibr 234	. . 3 ⊢ (𝜑 → 𝐼 ∈ (dom 𝑆 ∪ {𝐼}))
11	4, 10	prssd 4765	. 2 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ (dom 𝑆 ∪ {𝐼}))
12		basprssdmsets.s	. . . 4 ⊢ (𝜑 → 𝑆 Struct 𝑋)
13		structex 17120	. . . 4 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V)
14	12, 13	syl 17	. . 3 ⊢ (𝜑 → 𝑆 ∈ V)
15		basprssdmsets.w	. . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑊)
16		setsdm 17140	. . 3 ⊢ ((𝑆 ∈ V ∧ 𝐸 ∈ 𝑊) → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
17	14, 15, 16	syl2anc 585	. 2 ⊢ (𝜑 → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
18	11, 17	sseqtrrd 3959	1 ⊢ (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))

Syntax hints:   → wi 4   ∨ wo 848   = wceq 1542   ∈ wcel 2114  Vcvv 3429   ∪ cun 3887   ⊆ wss 3889  {csn 4567  {cpr 4569  ⟨cop 4573   class class class wbr 5085  dom cdm 5631  ‘cfv 6498  (class class class)co 7367   Struct cstr 17116   sSet csts 17133  ndxcnx 17163  Basecbs 17179

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-res 5643  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-struct 17117  df-sets 17134

This theorem is referenced by:  setsvtx  29104  setsiedg  29105