| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > enrefg | Structured version Visualization version GIF version | ||
| Description: Equinumerosity is reflexive. Theorem 1 of [Suppes] p. 92. (Contributed by NM, 18-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| enrefg | ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1oi 6861 | . . 3 ⊢ ( I ↾ 𝐴):𝐴–1-1-onto→𝐴 | |
| 2 | f1oen2g 8988 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉 ∧ ( I ↾ 𝐴):𝐴–1-1-onto→𝐴) → 𝐴 ≈ 𝐴) | |
| 3 | 1, 2 | mp3an3 1452 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → 𝐴 ≈ 𝐴) |
| 4 | 3 | anidms 566 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2109 class class class wbr 5124 I cid 5552 ↾ cres 5661 –1-1-onto→wf1o 6535 ≈ cen 8961 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-en 8965 |
| This theorem is referenced by: enref 9004 eqeng 9005 domrefg 9006 difsnen 9072 sdomirr 9133 mapdom1 9161 mapdom2 9167 rneqdmfinf1o 9350 infdifsn 9676 infdiffi 9677 onenon 9968 cardonle 9976 dju1en 10191 xpdjuen 10199 mapdjuen 10200 onadju 10213 nnadju 10217 ssfin4 10329 canthp1lem1 10671 gchhar 10698 hashfac 14481 mreexexlem3d 17663 cyggenod 19870 mdetunilem8 22562 frlmpwfi 43089 fiuneneq 43183 enrelmap 43988 |
| Copyright terms: Public domain | W3C validator |