| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > enrefnn | Structured version Visualization version GIF version | ||
| Description: Equinumerosity is reflexive for finite ordinals, proved without using the Axiom of Power Sets (unlike enrefg 8924). (Contributed by BTernaryTau, 31-Jul-2024.) |
| Ref | Expression |
|---|---|
| enrefnn | ⊢ (𝐴 ∈ ω → 𝐴 ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅) | |
| 2 | 1, 1 | breq12d 5099 | . 2 ⊢ (𝑥 = ∅ → (𝑥 ≈ 𝑥 ↔ ∅ ≈ ∅)) |
| 3 | id 22 | . . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 4 | 3, 3 | breq12d 5099 | . 2 ⊢ (𝑥 = 𝑦 → (𝑥 ≈ 𝑥 ↔ 𝑦 ≈ 𝑦)) |
| 5 | id 22 | . . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦) | |
| 6 | 5, 5 | breq12d 5099 | . 2 ⊢ (𝑥 = suc 𝑦 → (𝑥 ≈ 𝑥 ↔ suc 𝑦 ≈ suc 𝑦)) |
| 7 | id 22 | . . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴) | |
| 8 | 7, 7 | breq12d 5099 | . 2 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝑥 ↔ 𝐴 ≈ 𝐴)) |
| 9 | eqid 2737 | . . 3 ⊢ ∅ = ∅ | |
| 10 | en0 8958 | . . 3 ⊢ (∅ ≈ ∅ ↔ ∅ = ∅) | |
| 11 | 9, 10 | mpbir 231 | . 2 ⊢ ∅ ≈ ∅ |
| 12 | en2sn 8981 | . . . . . . 7 ⊢ ((𝑦 ∈ V ∧ 𝑦 ∈ V) → {𝑦} ≈ {𝑦}) | |
| 13 | 12 | el2v 3437 | . . . . . 6 ⊢ {𝑦} ≈ {𝑦} |
| 14 | 13 | jctr 524 | . . . . 5 ⊢ (𝑦 ≈ 𝑦 → (𝑦 ≈ 𝑦 ∧ {𝑦} ≈ {𝑦})) |
| 15 | nnord 7818 | . . . . . . 7 ⊢ (𝑦 ∈ ω → Ord 𝑦) | |
| 16 | orddisj 6355 | . . . . . . 7 ⊢ (Ord 𝑦 → (𝑦 ∩ {𝑦}) = ∅) | |
| 17 | 15, 16 | syl 17 | . . . . . 6 ⊢ (𝑦 ∈ ω → (𝑦 ∩ {𝑦}) = ∅) |
| 18 | 17, 17 | jca 511 | . . . . 5 ⊢ (𝑦 ∈ ω → ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅)) |
| 19 | unen 8985 | . . . . 5 ⊢ (((𝑦 ≈ 𝑦 ∧ {𝑦} ≈ {𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (𝑦 ∩ {𝑦}) = ∅)) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦})) | |
| 20 | 14, 18, 19 | syl2anr 598 | . . . 4 ⊢ ((𝑦 ∈ ω ∧ 𝑦 ≈ 𝑦) → (𝑦 ∪ {𝑦}) ≈ (𝑦 ∪ {𝑦})) |
| 21 | df-suc 6323 | . . . 4 ⊢ suc 𝑦 = (𝑦 ∪ {𝑦}) | |
| 22 | 20, 21, 21 | 3brtr4g 5120 | . . 3 ⊢ ((𝑦 ∈ ω ∧ 𝑦 ≈ 𝑦) → suc 𝑦 ≈ suc 𝑦) |
| 23 | 22 | ex 412 | . 2 ⊢ (𝑦 ∈ ω → (𝑦 ≈ 𝑦 → suc 𝑦 ≈ suc 𝑦)) |
| 24 | 2, 4, 6, 8, 11, 23 | finds 7840 | 1 ⊢ (𝐴 ∈ ω → 𝐴 ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∪ cun 3888 ∩ cin 3889 ∅c0 4274 {csn 4568 class class class wbr 5086 Ord word 6316 suc csuc 6319 ωcom 7810 ≈ cen 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-om 7811 df-en 8887 |
| This theorem is referenced by: nnfi 9095 pssnn 9096 phplem1 9131 nneneq 9133 onomeneq 9141 onfin 9142 isinf 9168 |
| Copyright terms: Public domain | W3C validator |