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

Theorem fidifsnid 6871
Description: If we remove a single element from a finite set then put it back in, we end up with the original finite set. This strengthens difsnss 3739 from subset to equality when the set is finite. (Contributed by Jim Kingdon, 9-Sep-2021.)
Assertion
Ref Expression
fidifsnid ((𝐴 ∈ Fin ∧ 𝐵𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)

Proof of Theorem fidifsnid
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fidceq 6869 . . . 4 ((𝐴 ∈ Fin ∧ 𝑥𝐴𝑦𝐴) → DECID 𝑥 = 𝑦)
213expb 1204 . . 3 ((𝐴 ∈ Fin ∧ (𝑥𝐴𝑦𝐴)) → DECID 𝑥 = 𝑦)
32ralrimivva 2559 . 2 (𝐴 ∈ Fin → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
4 dcdifsnid 6505 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐵𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)
53, 4sylan 283 1 ((𝐴 ∈ Fin ∧ 𝐵𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 834   = wceq 1353  wcel 2148  wral 2455  cdif 3127  cun 3128  {csn 3593  Fincfn 6740
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-nul 4130  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-iinf 4588
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-v 2740  df-sbc 2964  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-br 4005  df-opab 4066  df-tr 4103  df-id 4294  df-iord 4367  df-on 4369  df-suc 4372  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-en 6741  df-fin 6743
This theorem is referenced by:  findcard2  6889  findcard2s  6890  xpfi  6929  fisseneq  6931  zfz1isolem1  10820
  Copyright terms: Public domain W3C validator