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

Theorem bassetsnn 13132
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 3696 . . . . . . . . . 10 (𝐼 ∈ ℕ → 𝐼 ∈ {𝐼})
42, 3syl 14 . . . . . . . . 9 (𝜑𝐼 ∈ {𝐼})
5 basprssdmsets.w . . . . . . . . . 10 (𝜑𝐸𝑊)
6 dmsnopg 5206 . . . . . . . . . 10 (𝐸𝑊 → dom {⟨𝐼, 𝐸⟩} = {𝐼})
75, 6syl 14 . . . . . . . . 9 (𝜑 → dom {⟨𝐼, 𝐸⟩} = {𝐼})
84, 7eleqtrrd 2309 . . . . . . . 8 (𝜑𝐼 ∈ dom {⟨𝐼, 𝐸⟩})
9 elun2 3373 . . . . . . . 8 (𝐼 ∈ dom {⟨𝐼, 𝐸⟩} → 𝐼 ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
108, 9syl 14 . . . . . . 7 (𝜑𝐼 ∈ (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩}))
11 dmun 4936 . . . . . . 7 dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}) = (dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ dom {⟨𝐼, 𝐸⟩})
1210, 11eleqtrrdi 2323 . . . . . 6 (𝜑𝐼 ∈ dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
13 basprssdmsets.s . . . . . . . . 9 (𝜑𝑆 Struct 𝑋)
14 structex 13087 . . . . . . . . 9 (𝑆 Struct 𝑋𝑆 ∈ V)
1513, 14syl 14 . . . . . . . 8 (𝜑𝑆 ∈ V)
16 opexg 4318 . . . . . . . . 9 ((𝐼 ∈ ℕ ∧ 𝐸𝑊) → ⟨𝐼, 𝐸⟩ ∈ V)
172, 5, 16syl2anc 411 . . . . . . . 8 (𝜑 → ⟨𝐼, 𝐸⟩ ∈ V)
18 setsvalg 13105 . . . . . . . 8 ((𝑆 ∈ V ∧ ⟨𝐼, 𝐸⟩ ∈ V) → (𝑆 sSet ⟨𝐼, 𝐸⟩) = ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
1915, 17, 18syl2anc 411 . . . . . . 7 (𝜑 → (𝑆 sSet ⟨𝐼, 𝐸⟩) = ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
2019dmeqd 4931 . . . . . 6 (𝜑 → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
2112, 20eleqtrrd 2309 . . . . 5 (𝜑𝐼 ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
2221adantr 276 . . . 4 ((𝜑 ∧ (Base‘ndx) = 𝐼) → 𝐼 ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
231, 22eqeltrd 2306 . . 3 ((𝜑 ∧ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
24 basendxnn 13131 . . . . . . . . . . 11 (Base‘ndx) ∈ ℕ
2524elexi 2813 . . . . . . . . . 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 2308 . . . . . . . . . . 11 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → (Base‘ndx) ∈ {𝐼})
30 elsni 3685 . . . . . . . . . . 11 ((Base‘ndx) ∈ {𝐼} → (Base‘ndx) = 𝐼)
3129, 30syl 14 . . . . . . . . . 10 ((𝜑 ∧ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩}) → (Base‘ndx) = 𝐼)
3231stoic1a 1469 . . . . . . . . 9 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → ¬ (Base‘ndx) ∈ dom {⟨𝐼, 𝐸⟩})
3326, 32eldifd 3208 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ (V ∖ dom {⟨𝐼, 𝐸⟩}))
34 basprssdmsets.b . . . . . . . . 9 (𝜑 → (Base‘ndx) ∈ dom 𝑆)
3534adantr 276 . . . . . . . 8 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom 𝑆)
3633, 35elind 3390 . . . . . . 7 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ ((V ∖ dom {⟨𝐼, 𝐸⟩}) ∩ dom 𝑆))
37 dmres 5032 . . . . . . 7 dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) = ((V ∖ dom {⟨𝐼, 𝐸⟩}) ∩ dom 𝑆)
3836, 37eleqtrrdi 2323 . . . . . 6 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})))
39 elun1 3372 . . . . . 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 2323 . . . 4 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
4220adantr 276 . . . 4 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → dom (𝑆 sSet ⟨𝐼, 𝐸⟩) = dom ((𝑆 ↾ (V ∖ dom {⟨𝐼, 𝐸⟩})) ∪ {⟨𝐼, 𝐸⟩}))
4341, 42eleqtrrd 2309 . . 3 ((𝜑 ∧ ¬ (Base‘ndx) = 𝐼) → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
4424nnzi 9493 . . . . 5 (Base‘ndx) ∈ ℤ
452nnzd 9594 . . . . 5 (𝜑𝐼 ∈ ℤ)
46 zdceq 9548 . . . . 5 (((Base‘ndx) ∈ ℤ ∧ 𝐼 ∈ ℤ) → DECID (Base‘ndx) = 𝐼)
4744, 45, 46sylancr 414 . . . 4 (𝜑DECID (Base‘ndx) = 𝐼)
48 exmiddc 841 . . . 4 (DECID (Base‘ndx) = 𝐼 → ((Base‘ndx) = 𝐼 ∨ ¬ (Base‘ndx) = 𝐼))
4947, 48syl 14 . . 3 (𝜑 → ((Base‘ndx) = 𝐼 ∨ ¬ (Base‘ndx) = 𝐼))
5023, 43, 49mpjaodan 803 . 2 (𝜑 → (Base‘ndx) ∈ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
5150, 21prssd 3830 1 (𝜑 → {(Base‘ndx), 𝐼} ⊆ dom (𝑆 sSet ⟨𝐼, 𝐸⟩))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 713  DECID wdc 839   = wceq 1395  wcel 2200  Vcvv 2800  cdif 3195  cun 3196  cin 3197  wss 3198  {csn 3667  {cpr 3668  cop 3670   class class class wbr 4086  dom cdm 4723  cres 4725  cfv 5324  (class class class)co 6013  cn 9136  cz 9472   Struct cstr 13071  ndxcnx 13072   sSet csts 13073  Basecbs 13075
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-ltadd 8141
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-inn 9137  df-n0 9396  df-z 9473  df-struct 13077  df-ndx 13078  df-slot 13079  df-base 13081  df-sets 13082
This theorem is referenced by:  setsvtx  15895  setsiedg  15896
  Copyright terms: Public domain W3C validator