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

Theorem enrefnn 9023
Description: Equinumerosity is reflexive for finite ordinals, proved without using the Axiom of Power Sets (unlike enrefg 8961). (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 22 . . 3 (𝑥 = ∅ → 𝑥 = ∅)
21, 1breq12d 5112 . 2 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ≈ ∅))
3 id 22 . . 3 (𝑥 = 𝑦𝑥 = 𝑦)
43, 3breq12d 5112 . 2 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
5 id 22 . . 3 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
65, 5breq12d 5112 . 2 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦 ≈ suc 𝑦))
7 id 22 . . 3 (𝑥 = 𝐴𝑥 = 𝐴)
87, 7breq12d 5112 . 2 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
9 eqid 2761 . . 3 ∅ = ∅
10 en0 8995 . . 3 (∅ ≈ ∅ ↔ ∅ = ∅)
119, 10mpbir 233 . 2 ∅ ≈ ∅
12 en2sn 9018 . . . . . . 7 ((𝑦 ∈ V ∧ 𝑦 ∈ V) → {𝑦} ≈ {𝑦})
1312el2v 3460 . . . . . 6 {𝑦} ≈ {𝑦}
1413jctr 532 . . . . 5 (𝑦𝑦 → (𝑦𝑦 ∧ {𝑦} ≈ {𝑦}))
15 nnord 7850 . . . . . . 7 (𝑦 ∈ ω → Ord 𝑦)
16 orddisj 6380 . . . . . . 7 (Ord 𝑦 → (𝑦 ∩ {𝑦}) = ∅)
1715, 16syl 17 . . . . . 6 (𝑦 ∈ ω → (𝑦 ∩ {𝑦}) = ∅)
1817, 17jca 519 . . . . 5 (𝑦 ∈ ω → ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅))
19 unen 9022 . . . . 5 (((𝑦𝑦 ∧ {𝑦} ≈ {𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅)) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
2014, 18, 19syl2anr 606 . . . 4 ((𝑦 ∈ ω ∧ 𝑦𝑦) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
21 df-suc 6348 . . . 4 suc 𝑦 = (𝑦 ∪ {𝑦})
2220, 21, 213brtr4g 5133 . . 3 ((𝑦 ∈ ω ∧ 𝑦𝑦) → suc 𝑦 ≈ suc 𝑦)
2322ex 416 . 2 (𝑦 ∈ ω → (𝑦𝑦 → suc 𝑦 ≈ suc 𝑦))
242, 4, 6, 8, 11, 23finds 7873 1 (𝐴 ∈ ω → 𝐴𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  Vcvv 3453  cun 3902  cin 3903  c0 4285  {csn 4581   class class class wbr 5099  Ord word 6341  suc csuc 6344  ωcom 7842  cen 8920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-om 7843  df-en 8924
This theorem is referenced by:  nnfi  9132  pssnn  9133  phplem1  9168  nneneq  9170  onomeneq  9178  onfin  9179  isinf  9205
  Copyright terms: Public domain W3C validator