Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fidifsnid | GIF version |
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 3674 from subset to equality when the set is finite. (Contributed by Jim Kingdon, 9-Sep-2021.) |
Ref | Expression |
---|---|
fidifsnid | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fidceq 6771 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → DECID 𝑥 = 𝑦) | |
2 | 1 | 3expb 1183 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → DECID 𝑥 = 𝑦) |
3 | 2 | ralrimivva 2517 | . 2 ⊢ (𝐴 ∈ Fin → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) |
4 | dcdifsnid 6408 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴) | |
5 | 3, 4 | sylan 281 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 DECID wdc 820 = wceq 1332 ∈ wcel 1481 ∀wral 2417 ∖ cdif 3073 ∪ cun 3074 {csn 3532 Fincfn 6642 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-iinf 4510 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-br 3938 df-opab 3998 df-tr 4035 df-id 4223 df-iord 4296 df-on 4298 df-suc 4301 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-en 6643 df-fin 6645 |
This theorem is referenced by: findcard2 6791 findcard2s 6792 xpfi 6826 fisseneq 6828 zfz1isolem1 10615 |
Copyright terms: Public domain | W3C validator |