MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  basprssdmsets Structured version   Visualization version   GIF version

Theorem basprssdmsets 17240
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
StepHypRef Expression
1 basprssdmsets.b . . . . 5 (𝜑 → (Base‘ndx) ∈ dom 𝑆)
21orcd 884 . . . 4 (𝜑 → ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
3 elun 4106 . . . 4 ((Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}) ↔ ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
42, 3sylibr 236 . . 3 (𝜑 → (Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}))
5 basprssdmsets.i . . . . . 6 (𝜑𝐼𝑈)
6 snidg 4618 . . . . . 6 (𝐼𝑈𝐼 ∈ {𝐼})
75, 6syl 17 . . . . 5 (𝜑𝐼 ∈ {𝐼})
87olcd 885 . . . 4 (𝜑 → (𝐼 ∈ dom 𝑆𝐼 ∈ {𝐼}))
9 elun 4106 . . . 4 (𝐼 ∈ (dom 𝑆 ∪ {𝐼}) ↔ (𝐼 ∈ dom 𝑆𝐼 ∈ {𝐼}))
108, 9sylibr 236 . . 3 (𝜑𝐼 ∈ (dom 𝑆 ∪ {𝐼}))
114, 10prssd 4779 . 2 (𝜑 → {(Base‘ndx), 𝐼} ⊆ (dom 𝑆 ∪ {𝐼}))
12 basprssdmsets.s . . . 4 (𝜑𝑆 Struct 𝑋)
13 structex 17169 . . . 4 (𝑆 Struct 𝑋𝑆 ∈ V)
1412, 13syl 17 . . 3 (𝜑𝑆 ∈ V)
15 basprssdmsets.w . . 3 (𝜑𝐸𝑊)
16 setsdm 17189 . . 3 ((𝑆 ∈ V ∧ 𝐸𝑊) → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
1714, 15, 16syl2anc 593 . 2 (𝜑 → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
1811, 17sseqtrrd 3973 1 (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 858   = wceq 1559  wcel 2141  Vcvv 3453  cun 3902  wss 3904  {csn 4581  {cpr 4583  cop 4587   class class class wbr 5099  dom cdm 5645  cfv 6517  (class class class)co 7392   Struct cstr 17165   sSet csts 17182  ndxcnx 17212  Basecbs 17228
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-res 5657  df-iota 6473  df-fun 6519  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-struct 17166  df-sets 17183
This theorem is referenced by:  setsvtx  29182  setsiedg  29183
  Copyright terms: Public domain W3C validator