Theorem nneneq 6680

Description: Two equinumerous natural numbers are equal. Proposition 10.20 of [TakeutiZaring] p. 90 and its converse. Also compare Corollary 6E of [Enderton] p. 136. (Contributed by NM, 28-May-1998.)

Assertion

Ref	Expression
nneneq	|- ( ( A e. om /\ B e. om ) -> ( A ~~ B <-> A = B ) )

Proof of Theorem nneneq

Dummy variables x y z w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 3878	. . . . . 6 |- ( x = (/) -> ( x ~~ z <-> (/) ~~ z ) )
2		eqeq1 2106	. . . . . 6 |- ( x = (/) -> ( x = z <-> (/) = z ) )
3	1, 2	imbi12d 233	. . . . 5 |- ( x = (/) -> ( ( x ~~ z -> x = z ) <-> ( (/) ~~ z -> (/) = z ) ) )
4	3	ralbidv 2396	. . . 4 |- ( x = (/) -> ( A. z e. om ( x ~~ z -> x = z ) <-> A. z e. om ( (/) ~~ z -> (/) = z ) ) )
5		breq1 3878	. . . . . 6 |- ( x = y -> ( x ~~ z <-> y ~~ z ) )
6		eqeq1 2106	. . . . . 6 |- ( x = y -> ( x = z <-> y = z ) )
7	5, 6	imbi12d 233	. . . . 5 |- ( x = y -> ( ( x ~~ z -> x = z ) <-> ( y ~~ z -> y = z ) ) )
8	7	ralbidv 2396	. . . 4 |- ( x = y -> ( A. z e. om ( x ~~ z -> x = z ) <-> A. z e. om ( y ~~ z -> y = z ) ) )
9		breq1 3878	. . . . . 6 |- ( x = suc y -> ( x ~~ z <-> suc y ~~ z ) )
10		eqeq1 2106	. . . . . 6 |- ( x = suc y -> ( x = z <-> suc y = z ) )
11	9, 10	imbi12d 233	. . . . 5 |- ( x = suc y -> ( ( x ~~ z -> x = z ) <-> ( suc y ~~ z -> suc y = z ) ) )
12	11	ralbidv 2396	. . . 4 |- ( x = suc y -> ( A. z e. om ( x ~~ z -> x = z ) <-> A. z e. om ( suc y ~~ z -> suc y = z ) ) )
13		breq1 3878	. . . . . 6 |- ( x = A -> ( x ~~ z <-> A ~~ z ) )
14		eqeq1 2106	. . . . . 6 |- ( x = A -> ( x = z <-> A = z ) )
15	13, 14	imbi12d 233	. . . . 5 |- ( x = A -> ( ( x ~~ z -> x = z ) <-> ( A ~~ z -> A = z ) ) )
16	15	ralbidv 2396	. . . 4 |- ( x = A -> ( A. z e. om ( x ~~ z -> x = z ) <-> A. z e. om ( A ~~ z -> A = z ) ) )
17		ensym 6605	. . . . . 6 |- ( (/) ~~ z -> z ~~ (/) )
18		en0 6619	. . . . . . 7 |- ( z ~~ (/) <-> z = (/) )
19		eqcom 2102	. . . . . . 7 |- ( z = (/) <-> (/) = z )
20	18, 19	bitri 183	. . . . . 6 |- ( z ~~ (/) <-> (/) = z )
21	17, 20	sylib 121	. . . . 5 |- ( (/) ~~ z -> (/) = z )
22	21	rgenw 2446	. . . 4 |- A. z e. om ( (/) ~~ z -> (/) = z )
23		nn0suc 4456	. . . . . . 7 |- ( w e. om -> ( w = (/) \/ E. z e. om w = suc z ) )
24		en0 6619	. . . . . . . . . . . 12 |- ( suc y ~~ (/) <-> suc y = (/) )
25		breq2 3879	. . . . . . . . . . . . 13 |- ( w = (/) -> ( suc y ~~ w <-> suc y ~~ (/) ) )
26		eqeq2 2109	. . . . . . . . . . . . 13 |- ( w = (/) -> ( suc y = w <-> suc y = (/) ) )
27	25, 26	bibi12d 234	. . . . . . . . . . . 12 |- ( w = (/) -> ( ( suc y ~~ w <-> suc y = w ) <-> ( suc y ~~ (/) <-> suc y = (/) ) ) )
28	24, 27	mpbiri 167	. . . . . . . . . . 11 |- ( w = (/) -> ( suc y ~~ w <-> suc y = w ) )
29	28	biimpd 143	. . . . . . . . . 10 |- ( w = (/) -> ( suc y ~~ w -> suc y = w ) )
30	29	a1i 9	. . . . . . . . 9 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( w = (/) -> ( suc y ~~ w -> suc y = w ) ) )
31		nfv 1476	. . . . . . . . . . 11 |- F/ z y e. om
32		nfra1 2425	. . . . . . . . . . 11 |- F/ z A. z e. om ( y ~~ z -> y = z )
33	31, 32	nfan 1512	. . . . . . . . . 10 |- F/ z ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) )
34		nfv 1476	. . . . . . . . . 10 |- F/ z ( suc y ~~ w -> suc y = w )
35		rsp 2439	. . . . . . . . . . . . . 14 |- ( A. z e. om ( y ~~ z -> y = z ) -> ( z e. om -> ( y ~~ z -> y = z ) ) )
36		vex 2644	. . . . . . . . . . . . . . . . . 18 |- y e. _V
37		vex 2644	. . . . . . . . . . . . . . . . . 18 |- z e. _V
38	36, 37	phplem4 6678	. . . . . . . . . . . . . . . . 17 |- ( ( y e. om /\ z e. om ) -> ( suc y ~~ suc z -> y ~~ z ) )
39	38	imim1d 75	. . . . . . . . . . . . . . . 16 |- ( ( y e. om /\ z e. om ) -> ( ( y ~~ z -> y = z ) -> ( suc y ~~ suc z -> y = z ) ) )
40	39	ex 114	. . . . . . . . . . . . . . 15 |- ( y e. om -> ( z e. om -> ( ( y ~~ z -> y = z ) -> ( suc y ~~ suc z -> y = z ) ) ) )
41	40	a2d 26	. . . . . . . . . . . . . 14 |- ( y e. om -> ( ( z e. om -> ( y ~~ z -> y = z ) ) -> ( z e. om -> ( suc y ~~ suc z -> y = z ) ) ) )
42	35, 41	syl5 32	. . . . . . . . . . . . 13 |- ( y e. om -> ( A. z e. om ( y ~~ z -> y = z ) -> ( z e. om -> ( suc y ~~ suc z -> y = z ) ) ) )
43	42	imp 123	. . . . . . . . . . . 12 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( z e. om -> ( suc y ~~ suc z -> y = z ) ) )
44		suceq 4262	. . . . . . . . . . . 12 |- ( y = z -> suc y = suc z )
45	43, 44	syl8 71	. . . . . . . . . . 11 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( z e. om -> ( suc y ~~ suc z -> suc y = suc z ) ) )
46		breq2 3879	. . . . . . . . . . . . 13 |- ( w = suc z -> ( suc y ~~ w <-> suc y ~~ suc z ) )
47		eqeq2 2109	. . . . . . . . . . . . 13 |- ( w = suc z -> ( suc y = w <-> suc y = suc z ) )
48	46, 47	imbi12d 233	. . . . . . . . . . . 12 |- ( w = suc z -> ( ( suc y ~~ w -> suc y = w ) <-> ( suc y ~~ suc z -> suc y = suc z ) ) )
49	48	biimprcd 159	. . . . . . . . . . 11 |- ( ( suc y ~~ suc z -> suc y = suc z ) -> ( w = suc z -> ( suc y ~~ w -> suc y = w ) ) )
50	45, 49	syl6 33	. . . . . . . . . 10 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( z e. om -> ( w = suc z -> ( suc y ~~ w -> suc y = w ) ) ) )
51	33, 34, 50	rexlimd 2505	. . . . . . . . 9 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( E. z e. om w = suc z -> ( suc y ~~ w -> suc y = w ) ) )
52	30, 51	jaod 678	. . . . . . . 8 |- ( ( y e. om /\ A. z e. om ( y ~~ z -> y = z ) ) -> ( ( w = (/) \/ E. z e. om w = suc z ) -> ( suc y ~~ w -> suc y = w ) ) )
53	52	ex 114	. . . . . . 7 |- ( y e. om -> ( A. z e. om ( y ~~ z -> y = z ) -> ( ( w = (/) \/ E. z e. om w = suc z ) -> ( suc y ~~ w -> suc y = w ) ) ) )
54	23, 53	syl7 69	. . . . . 6 |- ( y e. om -> ( A. z e. om ( y ~~ z -> y = z ) -> ( w e. om -> ( suc y ~~ w -> suc y = w ) ) ) )
55	54	ralrimdv 2470	. . . . 5 |- ( y e. om -> ( A. z e. om ( y ~~ z -> y = z ) -> A. w e. om ( suc y ~~ w -> suc y = w ) ) )
56		breq2 3879	. . . . . . 7 |- ( w = z -> ( suc y ~~ w <-> suc y ~~ z ) )
57		eqeq2 2109	. . . . . . 7 |- ( w = z -> ( suc y = w <-> suc y = z ) )
58	56, 57	imbi12d 233	. . . . . 6 |- ( w = z -> ( ( suc y ~~ w -> suc y = w ) <-> ( suc y ~~ z -> suc y = z ) ) )
59	58	cbvralv 2612	. . . . 5 |- ( A. w e. om ( suc y ~~ w -> suc y = w ) <-> A. z e. om ( suc y ~~ z -> suc y = z ) )
60	55, 59	syl6ib 160	. . . 4 |- ( y e. om -> ( A. z e. om ( y ~~ z -> y = z ) -> A. z e. om ( suc y ~~ z -> suc y = z ) ) )
61	4, 8, 12, 16, 22, 60	finds 4452	. . 3 |- ( A e. om -> A. z e. om ( A ~~ z -> A = z ) )
62		breq2 3879	. . . . 5 |- ( z = B -> ( A ~~ z <-> A ~~ B ) )
63		eqeq2 2109	. . . . 5 |- ( z = B -> ( A = z <-> A = B ) )
64	62, 63	imbi12d 233	. . . 4 |- ( z = B -> ( ( A ~~ z -> A = z ) <-> ( A ~~ B -> A = B ) ) )
65	64	rspcv 2740	. . 3 |- ( B e. om -> ( A. z e. om ( A ~~ z -> A = z ) -> ( A ~~ B -> A = B ) ) )
66	61, 65	mpan9 277	. 2 |- ( ( A e. om /\ B e. om ) -> ( A ~~ B -> A = B ) )
67		eqeng 6590	. . 3 |- ( A e. om -> ( A = B -> A ~~ B ) )
68	67	adantr 272	. 2 |- ( ( A e. om /\ B e. om ) -> ( A = B -> A ~~ B ) )
69	66, 68	impbid 128	1 |- ( ( A e. om /\ B e. om ) -> ( A ~~ B <-> A = B ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 670   = wceq 1299   e. wcel 1448   A.wral 2375   E.wrex 2376   (/)c0 3310   class class class wbr 3875   suc csuc 4225   omcom 4442   ~~ cen 6562

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-nul 3994  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390  ax-iinf 4440

This theorem depends on definitions:  df-bi 116  df-dc 787  df-3or 931  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-ral 2380  df-rex 2381  df-rab 2384  df-v 2643  df-sbc 2863  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-nul 3311  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-br 3876  df-opab 3930  df-tr 3967  df-id 4153  df-iord 4226  df-on 4228  df-suc 4231  df-iom 4443  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-er 6359  df-en 6565

This theorem is referenced by:  findcard2  6712  findcard2s  6713  unsnfidcex  6737  unsnfidcel  6738  hashen  10371  hashunlem  10391