MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dif1ennnALT Structured version   Visualization version   GIF version

Theorem dif1ennnALT 9311
Description: Alternate proof of dif1ennn 9199 using ax-pow 5369. (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
dif1ennnALT ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) → (𝐴 ∖ {𝑋}) ≈ 𝑀)

Proof of Theorem dif1ennnALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 peano2 7902 . . . . 5 (𝑀 ∈ ω → suc 𝑀 ∈ ω)
2 breq2 5157 . . . . . . 7 (𝑥 = suc 𝑀 → (𝐴𝑥𝐴 ≈ suc 𝑀))
32rspcev 3608 . . . . . 6 ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω 𝐴𝑥)
4 isfi 9007 . . . . . 6 (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴𝑥)
53, 4sylibr 233 . . . . 5 ((suc 𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
61, 5sylan 578 . . . 4 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → 𝐴 ∈ Fin)
7 diffi 9213 . . . . 5 (𝐴 ∈ Fin → (𝐴 ∖ {𝑋}) ∈ Fin)
8 isfi 9007 . . . . 5 ((𝐴 ∖ {𝑋}) ∈ Fin ↔ ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
97, 8sylib 217 . . . 4 (𝐴 ∈ Fin → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
106, 9syl 17 . . 3 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
11103adant3 1129 . 2 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) → ∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥)
12 en2sn 9077 . . . . . . . 8 ((𝑋𝐴𝑥 ∈ V) → {𝑋} ≈ {𝑥})
1312elvd 3469 . . . . . . 7 (𝑋𝐴 → {𝑋} ≈ {𝑥})
14 nnord 7884 . . . . . . . 8 (𝑥 ∈ ω → Ord 𝑥)
15 orddisj 6414 . . . . . . . 8 (Ord 𝑥 → (𝑥 ∩ {𝑥}) = ∅)
1614, 15syl 17 . . . . . . 7 (𝑥 ∈ ω → (𝑥 ∩ {𝑥}) = ∅)
17 incom 4202 . . . . . . . . . 10 ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ({𝑋} ∩ (𝐴 ∖ {𝑋}))
18 disjdif 4476 . . . . . . . . . 10 ({𝑋} ∩ (𝐴 ∖ {𝑋})) = ∅
1917, 18eqtri 2754 . . . . . . . . 9 ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅
20 unen 9084 . . . . . . . . . 10 ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ {𝑋} ≈ {𝑥}) ∧ (((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅ ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
2120an4s 658 . . . . . . . . 9 ((((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ((𝐴 ∖ {𝑋}) ∩ {𝑋}) = ∅) ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
2219, 21mpanl2 699 . . . . . . . 8 (((𝐴 ∖ {𝑋}) ≈ 𝑥 ∧ ({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅)) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}))
2322expcom 412 . . . . . . 7 (({𝑋} ≈ {𝑥} ∧ (𝑥 ∩ {𝑥}) = ∅) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
2413, 16, 23syl2an 594 . . . . . 6 ((𝑋𝐴𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
25243ad2antl3 1184 . . . . 5 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥})))
26 difsnid 4819 . . . . . . . . 9 (𝑋𝐴 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
27 df-suc 6382 . . . . . . . . . . 11 suc 𝑥 = (𝑥 ∪ {𝑥})
2827eqcomi 2735 . . . . . . . . . 10 (𝑥 ∪ {𝑥}) = suc 𝑥
2928a1i 11 . . . . . . . . 9 (𝑋𝐴 → (𝑥 ∪ {𝑥}) = suc 𝑥)
3026, 29breq12d 5166 . . . . . . . 8 (𝑋𝐴 → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
31303ad2ant3 1132 . . . . . . 7 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
3231adantr 479 . . . . . 6 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) ↔ 𝐴 ≈ suc 𝑥))
33 ensym 9034 . . . . . . . . . . 11 (𝐴 ≈ suc 𝑀 → suc 𝑀𝐴)
34 entr 9037 . . . . . . . . . . . . 13 ((suc 𝑀𝐴𝐴 ≈ suc 𝑥) → suc 𝑀 ≈ suc 𝑥)
35 peano2 7902 . . . . . . . . . . . . . 14 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
36 nneneq 9243 . . . . . . . . . . . . . 14 ((suc 𝑀 ∈ ω ∧ suc 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
3735, 36sylan2 591 . . . . . . . . . . . . 13 ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 ≈ suc 𝑥 ↔ suc 𝑀 = suc 𝑥))
3834, 37imbitrid 243 . . . . . . . . . . . 12 ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → ((suc 𝑀𝐴𝐴 ≈ suc 𝑥) → suc 𝑀 = suc 𝑥))
3938expd 414 . . . . . . . . . . 11 ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀𝐴 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
4033, 39syl5 34 . . . . . . . . . 10 ((suc 𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
411, 40sylan 578 . . . . . . . . 9 ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑀 → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥)))
4241imp 405 . . . . . . . 8 (((𝑀 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ≈ suc 𝑀) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
4342an32s 650 . . . . . . 7 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
44433adantl3 1165 . . . . . 6 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → (𝐴 ≈ suc 𝑥 → suc 𝑀 = suc 𝑥))
4532, 44sylbid 239 . . . . 5 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → (((𝐴 ∖ {𝑋}) ∪ {𝑋}) ≈ (𝑥 ∪ {𝑥}) → suc 𝑀 = suc 𝑥))
46 peano4 7904 . . . . . . 7 ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥𝑀 = 𝑥))
4746biimpd 228 . . . . . 6 ((𝑀 ∈ ω ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥𝑀 = 𝑥))
48473ad2antl1 1182 . . . . 5 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → (suc 𝑀 = suc 𝑥𝑀 = 𝑥))
4925, 45, 483syld 60 . . . 4 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥𝑀 = 𝑥))
50 breq2 5157 . . . . 5 (𝑀 = 𝑥 → ((𝐴 ∖ {𝑋}) ≈ 𝑀 ↔ (𝐴 ∖ {𝑋}) ≈ 𝑥))
5150biimprcd 249 . . . 4 ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝑀 = 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
5249, 51sylcom 30 . . 3 (((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) ∧ 𝑥 ∈ ω) → ((𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
5352rexlimdva 3145 . 2 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) → (∃𝑥 ∈ ω (𝐴 ∖ {𝑋}) ≈ 𝑥 → (𝐴 ∖ {𝑋}) ≈ 𝑀))
5411, 53mpd 15 1 ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀𝑋𝐴) → (𝐴 ∖ {𝑋}) ≈ 𝑀)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1534  wcel 2099  wrex 3060  Vcvv 3462  cdif 3944  cun 3945  cin 3946  c0 4325  {csn 4633   class class class wbr 5153  Ord word 6375  suc csuc 6378  ωcom 7876  cen 8971  Fincfn 8974
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3967  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-br 5154  df-opab 5216  df-mpt 5237  df-tr 5271  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-ord 6379  df-on 6380  df-lim 6381  df-suc 6382  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-f1 6559  df-fo 6560  df-f1o 6561  df-fv 6562  df-om 7877  df-1o 8496  df-er 8734  df-en 8975  df-fin 8978
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator