Theorem dif1enALT 8980

Description: Alternate proof of dif1en 8907 with fewer symbols using ax-pow 5283. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Stefan O'Rear, 16-Aug-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Proof of Theorem dif1enALT

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2 7711	. . . . 5 ⊢ (𝑀 ∈ ω → suc 𝑀 ∈ ω)
2		breq2 5074	. . . . . . 7 ⊢ (𝑥 = suc 𝑀 → (𝐴 ≈ 𝑥 ↔ 𝐴 ≈ suc 𝑀))
3	2	rspcev 3552	. . . . . 6 ⊢ ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω 𝐴 ≈ 𝑥)
4		isfi 8719	. . . . . 6 ⊢ (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴 ≈ 𝑥)
5	3, 4	sylibr 233	. . . . 5 ⊢ ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
6	1, 5	sylan 579	. . . 4 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
7		diffi 8979	. . . . 5 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ {𝑋}) ∈ Fin)
8		isfi 8719	. . . . 5 ⊢ ((𝐴 ∖ {𝑋}) ∈ Fin ↔ ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
9	7, 8	sylib 217	. . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
10	6, 9	syl 17	. . 3 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
11	10	3adant3 1130	. 2 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
12		en2sn 8785	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 ∈ V) → {𝑋} ≈ {𝑥})
13	12	elvd 3429	. . . . . . 7 ⊢ (𝑋 ∈ 𝐴 → {𝑋} ≈ {𝑥})
14		nnord 7695	. . . . . . . 8 ⊢ (𝑥 ∈ ω → Ord 𝑥)
15		orddisj 6289	. . . . . . . 8 ⊢ (Ord 𝑥 → (𝑥 ∩ {𝑥}) = ∅)
16	14, 15	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ ω → (𝑥 ∩ {𝑥}) = ∅)
17		incom 4131	. . . . . . . . . 10 ⊢ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ({𝑋} ∩ (𝐴 ∖ {𝑋}))
18		disjdif 4402	. . . . . . . . . 10 ⊢ ({𝑋} ∩ (𝐴 ∖ {𝑋})) = ∅
19	17, 18	eqtri 2766	. . . . . . . . 9 ⊢ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅
20		unen 8790	. . . . . . . . . 10 ⊢ ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ {𝑋} ≈ {𝑥}) ∧ (((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅ ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
21	20	an4s 656	. . . . . . . . 9 ⊢ ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅) ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
22	19, 21	mpanl2 697	. . . . . . . 8 ⊢ (((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
23	22	expcom 413	. . . . . . 7 ⊢ (({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
24	13, 16, 23	syl2an 595	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
25	24	3ad2antl3 1185	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
26		difsnid 4740	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐴 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
27		df-suc 6257	. . . . . . . . . . 11 ⊢ suc 𝑥 = (𝑥 ∪ {𝑥})
28	27	eqcomi 2747	. . . . . . . . . 10 ⊢ (𝑥 ∪ {𝑥}) = suc 𝑥
29	28	a1i 11	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐴 → (𝑥 ∪ {𝑥}) = suc 𝑥)
30	26, 29	breq12d 5083	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐴 → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
31	30	3ad2ant3 1133	. . . . . . 7 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
32	31	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
33		ensym 8744	. . . . . . . . . . 11 ⊢ (𝐴 ≈ suc 𝑀 → suc 𝑀 ≈ 𝐴)
34		entr 8747	. . . . . . . . . . . . 13 ⊢ ((suc 𝑀 ≈ 𝐴 ∧ 𝐴 ≈ suc 𝑥) → suc 𝑀 ≈ suc 𝑥)
35		peano2 7711	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
36		nneneq 8896	. . . . . . . . . . . . . 14 ⊢ ((suc 𝑀 ∈ ω ∧ suc 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
37	35, 36	sylan2 592	. . . . . . . . . . . . 13 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
38	34, 37	syl5ib 243	. . . . . . . . . . . 12 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → ((suc 𝑀 ≈ 𝐴 ∧ 𝐴 ≈ suc 𝑥) → suc 𝑀 = suc 𝑥))
39	38	expd 415	. . . . . . . . . . 11 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 ≈ 𝐴 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
40	33, 39	syl5 34	. . . . . . . . . 10 ⊢ ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
41	1, 40	sylan 579	. . . . . . . . 9 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
42	41	imp 406	. . . . . . . 8 ⊢ (((𝑀 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ≈ suc 𝑀) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
43	42	an32s 648	. . . . . . 7 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
44	43	3adantl3 1166	. . . . . 6 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
45	32, 44	sylbid 239	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) → suc 𝑀 = suc 𝑥))
46		peano4 7713	. . . . . . 7 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 ↔ 𝑀 = 𝑥))
47	46	biimpd 228	. . . . . 6 ⊢ ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 → 𝑀 = 𝑥))
48	47	3ad2antl1 1183	. . . . 5 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥 → 𝑀 = 𝑥))
49	25, 45, 48	3syld 60	. . . 4 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → 𝑀 = 𝑥))
50		breq2 5074	. . . . 5 ⊢ (𝑀 = 𝑥 → ((𝐴 ∖ {𝑋}) ≈ 𝑀 ↔ (𝐴 ∖ {𝑋}) ≈ 𝑥))
51	50	biimprcd 249	. . . 4 ⊢ ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝑀 = 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
52	49, 51	sylcom 30	. . 3 ⊢ (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
53	52	rexlimdva 3212	. 2 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
54	11, 53	mpd 15	1 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑋 ∈ 𝐴) → (𝐴 ∖ {𝑋}) ≈ 𝑀)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∃wrex 3064  Vcvv 3422   ∖ cdif 3880   ∪ cun 3881   ∩ cin 3882  ∅c0 4253  {csn 4558   class class class wbr 5070  Ord word 6250  suc csuc 6253  ωcom 7687   ≈ cen 8688  Fincfn 8691

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-1o 8267  df-er 8456  df-en 8692  df-fin 8695

This theorem is referenced by: (None)