Theorem nndifsnid 6670

Description: If we remove a single element from a natural number then put it back in, we end up with the original natural number. This strengthens difsnss 3817 from subset to equality but the proof relies on equality being decidable. (Contributed by Jim Kingdon, 31-Aug-2021.)

Assertion

Ref	Expression
nndifsnid	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)

Proof of Theorem nndifsnid

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn 4702	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ ω) → 𝑥 ∈ ω)
2	1	expcom 116	. . . . 5 ⊢ (𝐴 ∈ ω → (𝑥 ∈ 𝐴 → 𝑥 ∈ ω))
3		elnn 4702	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ ω) → 𝑦 ∈ ω)
4	3	expcom 116	. . . . 5 ⊢ (𝐴 ∈ ω → (𝑦 ∈ 𝐴 → 𝑦 ∈ ω))
5	2, 4	anim12d 335	. . . 4 ⊢ (𝐴 ∈ ω → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ ω ∧ 𝑦 ∈ ω)))
6		nndceq 6662	. . . 4 ⊢ ((𝑥 ∈ ω ∧ 𝑦 ∈ ω) → DECID 𝑥 = 𝑦)
7	5, 6	syl6 33	. . 3 ⊢ (𝐴 ∈ ω → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → DECID 𝑥 = 𝑦))
8	7	ralrimivv 2611	. 2 ⊢ (𝐴 ∈ ω → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
9		dcdifsnid 6667	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)
10	8, 9	sylan 283	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104  DECID wdc 839   = wceq 1395   ∈ wcel 2200  ∀wral 2508   ∖ cdif 3195   ∪ cun 3196  {csn 3667  ωcom 4686

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-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-uni 3892  df-int 3927  df-tr 4186  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687

This theorem is referenced by:  phplem2  7034