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

Theorem enrefnn 9031
Description: Equinumerosity is reflexive for finite ordinals, proved without using the Axiom of Power Sets (unlike enrefg 8969). (Contributed by BTernaryTau, 31-Jul-2024.)
Assertion
Ref Expression
enrefnn (𝐴 ∈ ω → 𝐴𝐴)

Proof of Theorem enrefnn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 23 . . 3 (𝑥 = ∅ → 𝑥 = ∅)
21, 1breq12d 5118 . 2 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ≈ ∅))
3 id 23 . . 3 (𝑥 = 𝑦𝑥 = 𝑦)
43, 3breq12d 5118 . 2 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
5 id 23 . . 3 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
65, 5breq12d 5118 . 2 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦 ≈ suc 𝑦))
7 id 23 . . 3 (𝑥 = 𝐴𝑥 = 𝐴)
87, 7breq12d 5118 . 2 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
9 eqid 2765 . . 3 ∅ = ∅
10 en0 9003 . . 3 (∅ ≈ ∅ ↔ ∅ = ∅)
119, 10mpbir 234 . 2 ∅ ≈ ∅
12 en2sn 9026 . . . . . . 7 ((𝑦 ∈ V ∧ 𝑦 ∈ V) → {𝑦} ≈ {𝑦})
1312el2v 3464 . . . . . 6 {𝑦} ≈ {𝑦}
1413jctr 533 . . . . 5 (𝑦𝑦 → (𝑦𝑦 ∧ {𝑦} ≈ {𝑦}))
15 nnord 7858 . . . . . . 7 (𝑦 ∈ ω → Ord 𝑦)
16 orddisj 6388 . . . . . . 7 (Ord 𝑦 → (𝑦 ∩ {𝑦}) = ∅)
1715, 16syl 18 . . . . . 6 (𝑦 ∈ ω → (𝑦 ∩ {𝑦}) = ∅)
1817, 17jca 520 . . . . 5 (𝑦 ∈ ω → ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅))
19 unen 9030 . . . . 5 (((𝑦𝑦 ∧ {𝑦} ≈ {𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅)) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
2014, 18, 19syl2anr 608 . . . 4 ((𝑦 ∈ ω ∧ 𝑦𝑦) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
21 df-suc 6356 . . . 4 suc 𝑦 = (𝑦 ∪ {𝑦})
2220, 21, 213brtr4g 5139 . . 3 ((𝑦 ∈ ω ∧ 𝑦𝑦) → suc 𝑦 ≈ suc 𝑦)
2322ex 417 . 2 (𝑦 ∈ ω → (𝑦𝑦 → suc 𝑦 ≈ suc 𝑦))
242, 4, 6, 8, 11, 23finds 7881 1 (𝐴 ∈ ω → 𝐴𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  Vcvv 3457  cun 3905  cin 3906  c0 4288  {csn 4585   class class class wbr 5105  Ord word 6349  suc csuc 6352  ωcom 7850  cen 8928
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-om 7851  df-en 8932
This theorem is referenced by:  nnfi  9140  pssnn  9141  phplem1  9176  nneneq  9178  onomeneq  9186  onfin  9187  isinf  9213
  Copyright terms: Public domain W3C validator