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

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
StepHypRef Expression
1 basprssdmsets.b . . . . 5 (𝜑 → (Base‘ndx) ∈ dom 𝑆)
21orcd 873 . . . 4 (𝜑 → ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
3 elun 4116 . . . 4 ((Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}) ↔ ((Base‘ndx) ∈ dom 𝑆 ∨ (Base‘ndx) ∈ {𝐼}))
42, 3sylibr 234 . . 3 (𝜑 → (Base‘ndx) ∈ (dom 𝑆 ∪ {𝐼}))
5 basprssdmsets.i . . . . . 6 (𝜑𝐼𝑈)
6 snidg 4624 . . . . . 6 (𝐼𝑈𝐼 ∈ {𝐼})
75, 6syl 17 . . . . 5 (𝜑𝐼 ∈ {𝐼})
87olcd 874 . . . 4 (𝜑 → (𝐼 ∈ dom 𝑆𝐼 ∈ {𝐼}))
9 elun 4116 . . . 4 (𝐼 ∈ (dom 𝑆 ∪ {𝐼}) ↔ (𝐼 ∈ dom 𝑆𝐼 ∈ {𝐼}))
108, 9sylibr 234 . . 3 (𝜑𝐼 ∈ (dom 𝑆 ∪ {𝐼}))
114, 10prssd 4786 . 2 (𝜑 → {(Base‘ndx), 𝐼} ⊆ (dom 𝑆 ∪ {𝐼}))
12 basprssdmsets.s . . . 4 (𝜑𝑆 Struct 𝑋)
13 structex 17120 . . . 4 (𝑆 Struct 𝑋𝑆 ∈ V)
1412, 13syl 17 . . 3 (𝜑𝑆 ∈ V)
15 basprssdmsets.w . . 3 (𝜑𝐸𝑊)
16 setsdm 17140 . . 3 ((𝑆 ∈ V ∧ 𝐸𝑊) → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
1714, 15, 16syl2anc 584 . 2 (𝜑 → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = (dom 𝑆 ∪ {𝐼}))
1811, 17sseqtrrd 3984 1 (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 847   = wceq 1540  wcel 2109  Vcvv 3447  cun 3912  wss 3914  {csn 4589  {cpr 4591  cop 4595   class class class wbr 5107  dom cdm 5638  cfv 6511  (class class class)co 7387   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 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-res 5650  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-struct 17117  df-sets 17134
This theorem is referenced by:  setsvtx  28962  setsiedg  28963
  Copyright terms: Public domain W3C validator