ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bassetsnn GIF version

Theorem bassetsnn 13258
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 𝑋)
bassetsnn.i (𝜑𝐼 ∈ ℕ)
basprssdmsets.w (𝜑𝐸𝑊)
basprssdmsets.b (𝜑 → (Base‘ndx) ∈ dom 𝑆)
Assertion
Ref Expression
bassetsnn (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))

Proof of Theorem bassetsnn
StepHypRef Expression
1 simpr 110 . . . 4 ((𝜑 ∧ (Base‘ndx) = 𝐼) → (Base‘ndx) = 𝐼)
2 bassetsnn.i . . . . . . . . . 10 (𝜑𝐼 ∈ ℕ)
3 snidg 3717 . . . . . . . . . 10 (𝐼 ∈ ℕ → 𝐼 ∈ {𝐼})
42, 3syl 14 . . . . . . . . 9 (𝜑𝐼 ∈ {𝐼})
5 basprssdmsets.w . . . . . . . . . 10 (𝜑𝐸𝑊)
6 dmsnopg 5233 . . . . . . . . . 10 (𝐸𝑊 → dom {⟨𝐼, 𝐸⟩} = {𝐼})
75, 6syl 14 . . . . . . . . 9 (𝜑 → dom {⟨𝐼, 𝐸⟩} = {𝐼})
84, 7eleqtrrd 2312 . . . . . . . 8 (𝜑𝐼 ∈ dom {⟨𝐼, 𝐸⟩})
9 elun2 3386 . . . . . . . 8 (𝐼 ∈ dom {⟨𝐼, 𝐸⟩} → 𝐼 ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
108, 9syl 14 . . . . . . 7 (𝜑𝐼 ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
11 dmun 4962 . . . . . . 7 dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}) = (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩})
1210, 11eleqtrrdi 2326 . . . . . 6 (𝜑𝐼 ∈ dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
13 basprssdmsets.s . . . . . . . . 9 (𝜑𝑆 Struct 𝑋)
14 structex 13213 . . . . . . . . 9 (𝑆 Struct 𝑋𝑆 ∈ V)
1513, 14syl 14 . . . . . . . 8 (𝜑𝑆 ∈ V)
16 opexg 4343 . . . . . . . . 9 ((𝐼 ∈ ℕ ∧ 𝐸𝑊) → ⟨𝐼, 𝐸⟩ ∈ V)
172, 5, 16syl2anc 411 . . . . . . . 8 (𝜑 → ⟨𝐼, 𝐸⟩ ∈ V)
18 setsvalg 13231 . . . . . . . 8 ((𝑆 ∈ V ∧ ⟨𝐼, 𝐸⟩ ∈ V) → (𝑆 sSet ⟨𝐼, 𝐸⟩) = ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
1915, 17, 18syl2anc 411 . . . . . . 7 (𝜑 → (𝑆 sSet ⟨𝐼, 𝐸⟩) = ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
2019dmeqd 4957 . . . . . 6 (𝜑 → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
2112, 20eleqtrrd 2312 . . . . 5 (𝜑𝐼 ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
2221adantr 276 . . . 4 ((𝜑 ∧ (Base‘ndx) = 𝐼) → 𝐼 ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
231, 22eqeltrd 2309 . . 3 ((𝜑 ∧ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
24 basendxnn 13257 . . . . . . . . . . 11 (Base‘ndx) ∈ ℕ
2524elexi 2825 . . . . . . . . . 10 (Base‘ndx) ∈ V
2625a1i 9 . . . . . . . . 9 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ V)
27 simpr 110 . . . . . . . . . . . 12 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩})
287adantr 276 . . . . . . . . . . . 12 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → dom {⟨𝐼, 𝐸⟩} = {𝐼})
2927, 28eleqtrd 2311 . . . . . . . . . . 11 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → (Base‘ndx) ∈ {𝐼})
30 elsni 3706 . . . . . . . . . . 11 ((Base‘ndx) ∈ {𝐼} → (Base‘ndx) = 𝐼)
3129, 30syl 14 . . . . . . . . . 10 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → (Base‘ndx) = 𝐼)
3231stoic1a 1472 . . . . . . . . 9 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → ¬ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩})
3326, 32eldifd 3220 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ (V ∖ dom {⟨𝐼, 𝐸⟩}))
34 basprssdmsets.b . . . . . . . . 9 (𝜑 → (Base‘ndx) ∈ dom 𝑆)
3534adantr 276 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom 𝑆)
3633, 35elind 3403 . . . . . . 7 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ ((V ∖ dom {⟨𝐼, 𝐸⟩}) ∩ dom 𝑆))
37 dmres 5058 . . . . . . 7 dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) = ((V ∖ dom {⟨𝐼, 𝐸⟩}) ∩ dom 𝑆)
3836, 37eleqtrrdi 2326 . . . . . 6 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})))
39 elun1 3385 . . . . . 6 ((Base‘ndx) ∈ dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) → (Base‘ndx) ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
4038, 39syl 14 . . . . 5 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
4140, 11eleqtrrdi 2326 . . . 4 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
4220adantr 276 . . . 4 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
4341, 42eleqtrrd 2312 . . 3 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
4424nnzi 9594 . . . . 5 (Base‘ndx) ∈ ℤ
452nnzd 9695 . . . . 5 (𝜑𝐼 ∈ ℤ)
46 zdceq 9649 . . . . 5 (((Base‘ndx) ∈ ℤ ∧ 𝐼 ∈ ℤ) → DECID (Base‘ndx) = 𝐼)
4744, 45, 46sylancr 414 . . . 4 (𝜑DECID (Base‘ndx) = 𝐼)
48 exmiddc 844 . . . 4 (DECID (Base‘ndx) = 𝐼 → ((Base‘ndx) = 𝐼 ∨ ¬ (Base‘ndx) = 𝐼))
4947, 48syl 14 . . 3 (𝜑 → ((Base‘ndx) = 𝐼 ∨ ¬ (Base‘ndx) = 𝐼))
5023, 43, 49mpjaodan 806 . 2 (𝜑 → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
5150, 21prssd 3852 1 (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 716  DECID wdc 842   = wceq 1398  wcel 2203  Vcvv 2812  cdif 3207  cun 3208  cin 3209  wss 3210  {csn 3688  {cpr 3689  cop 3691   class class class wbr 4108  dom cdm 4748  cres 4750  cfv 5351  (class class class)co 6049  cn 9233  cz 9573   Struct cstr 13197  ndxcnx 13198   sSet csts 13199  Basecbs 13201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-addass 8225  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-ltadd 8239
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-inn 9234  df-n0 9493  df-z 9574  df-struct 13203  df-ndx 13204  df-slot 13205  df-base 13207  df-sets 13208
This theorem is referenced by:  setsvtx  16033  setsiedg  16034
  Copyright terms: Public domain W3C validator