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

Theorem setsabsd 13243
Description: Replacing the same components twice yields the same as the second setting only. (Contributed by Mario Carneiro, 2-Dec-2014.) (Revised by Jim Kingdon, 22-Jan-2023.)
Hypotheses
Ref Expression
setsabsd.s (𝜑𝑆𝑉)
setsabsd.a (𝜑𝐴𝑊)
setsabsd.b (𝜑𝐵𝑋)
setsabsd.c (𝜑𝐶𝑈)
Assertion
Ref Expression
setsabsd (𝜑 → ((𝑆 sSet ⟨𝐴, 𝐵⟩) sSet ⟨𝐴, 𝐶⟩) = (𝑆 sSet ⟨𝐴, 𝐶⟩))

Proof of Theorem setsabsd
StepHypRef Expression
1 setsabsd.s . . . 4 (𝜑𝑆𝑉)
2 setsabsd.a . . . 4 (𝜑𝐴𝑊)
3 setsabsd.b . . . 4 (𝜑𝐵𝑋)
4 setsresg 13242 . . . 4 ((𝑆𝑉𝐴𝑊𝐵𝑋) → ((𝑆 sSet ⟨𝐴, 𝐵⟩) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴})))
51, 2, 3, 4syl3anc 1274 . . 3 (𝜑 → ((𝑆 sSet ⟨𝐴, 𝐵⟩) ↾ (V ∖ {𝐴})) = (𝑆 ↾ (V ∖ {𝐴})))
65uneq1d 3371 . 2 (𝜑 → (((𝑆 sSet ⟨𝐴, 𝐵⟩) ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}))
7 setsex 13236 . . . 4 ((𝑆𝑉𝐴𝑊𝐵𝑋) → (𝑆 sSet ⟨𝐴, 𝐵⟩) ∈ V)
81, 2, 3, 7syl3anc 1274 . . 3 (𝜑 → (𝑆 sSet ⟨𝐴, 𝐵⟩) ∈ V)
9 setsabsd.c . . 3 (𝜑𝐶𝑈)
10 setsvala 13235 . . 3 (((𝑆 sSet ⟨𝐴, 𝐵⟩) ∈ V ∧ 𝐴𝑊𝐶𝑈) → ((𝑆 sSet ⟨𝐴, 𝐵⟩) sSet ⟨𝐴, 𝐶⟩) = (((𝑆 sSet ⟨𝐴, 𝐵⟩) ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}))
118, 2, 9, 10syl3anc 1274 . 2 (𝜑 → ((𝑆 sSet ⟨𝐴, 𝐵⟩) sSet ⟨𝐴, 𝐶⟩) = (((𝑆 sSet ⟨𝐴, 𝐵⟩) ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}))
12 setsvala 13235 . . 3 ((𝑆𝑉𝐴𝑊𝐶𝑈) → (𝑆 sSet ⟨𝐴, 𝐶⟩) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}))
131, 2, 9, 12syl3anc 1274 . 2 (𝜑 → (𝑆 sSet ⟨𝐴, 𝐶⟩) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐶⟩}))
146, 11, 133eqtr4d 2275 1 (𝜑 → ((𝑆 sSet ⟨𝐴, 𝐵⟩) sSet ⟨𝐴, 𝐶⟩) = (𝑆 sSet ⟨𝐴, 𝐶⟩))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2203  Vcvv 2812  cdif 3207  cun 3208  {csn 3688  cop 3691  cres 4750  (class class class)co 6049   sSet csts 13202
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
This theorem depends on definitions:  df-bi 117  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-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-res 4760  df-iota 5311  df-fun 5353  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-sets 13211
This theorem is referenced by:  ressressg  13280
  Copyright terms: Public domain W3C validator