Theorem dif1en 8745

Description: If a set 𝐴 is equinumerous to the successor of a natural number 𝑀, then 𝐴 with an element removed is equinumerous to 𝑀. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Stefan O'Rear, 16-Aug-2015.)

Assertion

Ref	Expression
dif1en	⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (𝐴 ∖ {𝑋}) ≈ 𝑀)

Proof of Theorem dif1en

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2 7596	. . . . 5 ⊢ (𝑀 ∈ ω → suc 𝑀 ∈ ω)
2		breq2 5062	. . . . . . 7 ⊢ (𝑥 = suc 𝑀 → (𝐴 ≈ 𝑥 ↔ 𝐴 ≈ suc 𝑀))
3	2	rspcev 3622	. . . . . 6 ⊢ ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω 𝐴 ≈ 𝑥)
4		isfi 8527	. . . . . 6 ⊢ (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴 ≈ 𝑥)
5	3, 4	sylibr 236	. . . . 5 ⊢ ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
6	1, 5	sylan 582	. . . 4 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
7		diffi 8744	. . . . 5 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝑋}) ∈ Fin)
8		isfi 8527	. . . . 5 ⊢ ((𝐴 ∖ {𝑋}) ∈ Fin ↔ ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
9	7, 8	sylib 220	. . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
10	6, 9	syl 17	. . 3 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
11	10	3adant3 1128	. 2 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
12		en2sn 8587	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 ∈ V) → {𝑋} ≈ {𝑥})
13	12	elvd 3500	. . . . . . 7 ⊢ (𝑋 ∈ 𝐴 → {𝑋} ≈ {𝑥})
14		nnord 7582	. . . . . . . 8 ⊢ (𝑥 ∈ ω → Ord 𝑥)
15		orddisj 6223	. . . . . . . 8 ⊢ (Ord 𝑥 → (𝑥 ∩ {𝑥}) = ∅)
16	14, 15	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ ω → (𝑥 ∩ {𝑥}) = ∅)
17		incom 4177	. . . . . . . . . 10 ⊢ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ({𝑋} ∩ (𝐴 ∖ {𝑋}))
18		disjdif 4420	. . . . . . . . . 10 ⊢ ({𝑋} ∩ (𝐴 ∖ {𝑋})) = ∅
19	17, 18	eqtri 2844	. . . . . . . . 9 ⊢ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅
20		unen 8590	. . . . . . . . . 10 ⊢ ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ {𝑋} ≈ {𝑥}) ∧ (((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅ ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
21	20	an4s 658	. . . . . . . . 9 ⊢ ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅) ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
22	19, 21	mpanl2 699	. . . . . . . 8 ⊢ (((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
23	22	expcom 416	. . . . . . 7 ⊢ (({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
24	13, 16, 23	syl2an 597	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
25	24	3ad2antl3 1183	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
26		difsnid 4736	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐴 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
27		df-suc 6191	. . . . . . . . . . 11 ⊢ suc 𝑥 = (𝑥 ∪ {𝑥})
28	27	eqcomi 2830	. . . . . . . . . 10 ⊢ (𝑥 ∪ {𝑥}) = suc 𝑥
29	28	a1i 11	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐴 → (𝑥 ∪ {𝑥}) = suc 𝑥)
30	26, 29	breq12d 5071	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐴 → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
31	30	3ad2ant3 1131	. . . . . . 7 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
32	31	adantr 483	. . . . . 6 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
33		ensym 8552	. . . . . . . . . . 11 ⊢ (𝐴 ≈ suc 𝑀 → suc 𝑀 ≈ 𝐴)
34		entr 8555	. . . . . . . . . . . . 13 ⊢ ((suc 𝑀 ≈ 𝐴 ∧ 𝐴 ≈ suc 𝑥) → suc 𝑀 ≈ suc 𝑥)
35		peano2 7596	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
36		nneneq 8694	. . . . . . . . . . . . . 14 ⊢ ((suc 𝑀 ∈ ω ∧ suc 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
37	35, 36	sylan2 594	. . . . . . . . . . . . 13 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
38	34, 37	syl5ib 246	. . . . . . . . . . . 12 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → ((suc 𝑀 ≈ 𝐴 ∧ 𝐴 ≈ suc 𝑥) → suc 𝑀 = suc 𝑥))
39	38	expd 418	. . . . . . . . . . 11 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 ≈ 𝐴 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
40	33, 39	syl5 34	. . . . . . . . . 10 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
41	1, 40	sylan 582	. . . . . . . . 9 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
42	41	imp 409	. . . . . . . 8 ⊢ (((𝑀 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ≈ suc 𝑀) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
43	42	an32s 650	. . . . . . 7 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
44	43	3adantl3 1164	. . . . . 6 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
45	32, 44	sylbid 242	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) → suc 𝑀 = suc 𝑥))
46		peano4 7598	. . . . . . 7 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 ↔ 𝑀 = 𝑥))
47	46	biimpd 231	. . . . . 6 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 → 𝑀 = 𝑥))
48	47	3ad2antl1 1181	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 → 𝑀 = 𝑥))
49	25, 45, 48	3syld 60	. . . 4 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → 𝑀 = 𝑥))
50		breq2 5062	. . . . 5 ⊢ (𝑀 = 𝑥 → ((𝐴 ∖ {𝑋}) ≈ 𝑀 ↔ (𝐴 ∖ {𝑋}) ≈ 𝑥))
51	50	biimprcd 252	. . . 4 ⊢ ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝑀 = 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
52	49, 51	sylcom 30	. . 3 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
53	52	rexlimdva 3284	. 2 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
54	11, 53	mpd 15	1 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (𝐴 ∖ {𝑋}) ≈ 𝑀)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  ∃wrex 3139  Vcvv 3494   ∖ cdif 3932   ∪ cun 3933   ∩ cin 3934  ∅c0 4290  {csn 4560   class class class wbr 5058  Ord word 6184  suc csuc 6187  ωcom 7574   ≈ cen 8500  Fincfn 8503

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-om 7575  df-1o 8096  df-er 8283  df-en 8504  df-fin 8507

This theorem is referenced by:  enp1i  8747  findcard  8751  findcard2  8752  en2eleq  9428  en2other2  9429  mreexexlem4d  16912  f1otrspeq  18569  pmtrf  18577  pmtrmvd  18578  pmtrfinv  18583