Theorem enrefnn 9105

Description: Equinumerosity is reflexive for finite ordinals, proved without using the Axiom of Power Sets (unlike enrefg 9042). (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.

Step	Hyp	Ref	Expression
1		id 23	. . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
2	1, 1	breq12d 5119	. 2 ⊢ (𝑥 = ∅ → (𝑥 ≈ 𝑥 ↔ ∅ ≈ ∅))
3		id 23	. . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4	3, 3	breq12d 5119	. 2 ⊢ (𝑥 = 𝑦 → (𝑥 ≈ 𝑥 ↔ 𝑦 ≈ 𝑦))
5		id 23	. . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦)
6	5, 5	breq12d 5119	. 2 ⊢ (𝑥 = suc 𝑦 → (𝑥 ≈ 𝑥 ↔ suc 𝑦 ≈ suc 𝑦))
7		id 23	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
8	7, 7	breq12d 5119	. 2 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝑥 ↔ 𝐴 ≈ 𝐴))
9		eqid 2763	. . 3 ⊢ ∅ = ∅
10		en0 9076	. . 3 ⊢ (∅ ≈ ∅ ↔ ∅ = ∅)
11	9, 10	mpbir 234	. 2 ⊢ ∅ ≈ ∅
12		en2sn 9100	. . . . . . 7 ⊢ ((𝑦 ∈ V ∧ 𝑦 ∈ V) → {𝑦} ≈ {𝑦})
13	12	el2v 3461	. . . . . 6 ⊢ {𝑦} ≈ {𝑦}
14	13	jctr 534	. . . . 5 ⊢ (𝑦 ≈ 𝑦 → (𝑦 ≈ 𝑦 ∧ {𝑦} ≈ {𝑦}))
15		nnord 7912	. . . . . . 7 ⊢ (𝑦 ∈ ω → Ord 𝑦)
16		orddisj 6422	. . . . . . 7 ⊢ (Ord 𝑦 → (𝑦 ∩ {𝑦}) = ∅)
17	15, 16	syl 18	. . . . . 6 ⊢ (𝑦 ∈ ω → (𝑦 ∩ {𝑦}) = ∅)
18	17, 17	jca 521	. . . . 5 ⊢ (𝑦 ∈ ω → ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅))
19		unen 9104	. . . . 5 ⊢ (((𝑦 ≈ 𝑦 ∧ {𝑦} ≈ {𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅)) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
20	14, 18, 19	syl2anr 609	. . . 4 ⊢ ((𝑦 ∈ ω ∧ 𝑦 ≈ 𝑦) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦}))
21		df-suc 6389	. . . 4 ⊢ suc 𝑦 = (𝑦 ∪ {𝑦})
22	20, 21, 21	3brtr4g 5143	. . 3 ⊢ ((𝑦 ∈ ω ∧ 𝑦 ≈ 𝑦) → suc 𝑦 ≈ suc 𝑦)
23	22	ex 418	. 2 ⊢ (𝑦 ∈ ω → (𝑦 ≈ 𝑦 → suc 𝑦 ≈ suc 𝑦))
24	2, 4, 6, 8, 11, 23	finds 7935	1 ⊢ (𝐴 ∈ ω → 𝐴 ≈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  {csn 4588   class class class wbr 5106  Ord word 6382  suc csuc 6385  ωcom 7904   ≈ cen 9001

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-om 7905  df-en 9005

This theorem is used by:  nnfi  9214  pssnn  9215  phplem1  9250  nneneq  9252  onomeneq  9260  onfin  9261  isinf  9287  kardnnfi  35950