Theorem nn0opthd 10704

Description: An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. We can represent an ordered pair of nonnegative integers A and B by ( ( ( A + B ) x. ( A + B ) ) + B ). If two such ordered pairs are equal, their first elements are equal and their second elements are equal. Contrast this ordered pair representation with the standard one df-op 3603 that works for any set. (Contributed by Jim Kingdon, 31-Oct-2021.)

Hypotheses

Ref	Expression
nn0opthd.1	|- ( ph -> A e. NN0 )
nn0opthd.2	|- ( ph -> B e. NN0 )
nn0opthd.3	|- ( ph -> C e. NN0 )
nn0opthd.4	|- ( ph -> D e. NN0 )

Assertion

Ref	Expression
nn0opthd	|- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) <-> ( A = C /\ B = D ) ) )

Proof of Theorem nn0opthd

Step	Hyp	Ref	Expression
1		nn0opthd.1	. . . . . . . . . . . . . . 15 |- ( ph -> A e. NN0 )
2		nn0opthd.2	. . . . . . . . . . . . . . 15 |- ( ph -> B e. NN0 )
3		nn0opthd.3	. . . . . . . . . . . . . . . 16 |- ( ph -> C e. NN0 )
4		nn0opthd.4	. . . . . . . . . . . . . . . 16 |- ( ph -> D e. NN0 )
5	3, 4	nn0addcld 9235	. . . . . . . . . . . . . . 15 |- ( ph -> ( C + D ) e. NN0 )
6	1, 2, 5, 4	nn0opthlem2d 10703	. . . . . . . . . . . . . 14 |- ( ph -> ( ( A + B ) < ( C + D ) -> ( ( ( C + D ) x. ( C + D ) ) + D ) =/= ( ( ( A + B ) x. ( A + B ) ) + B ) ) )
7	6	imp 124	. . . . . . . . . . . . 13 |- ( ( ph /\ ( A + B ) < ( C + D ) ) -> ( ( ( C + D ) x. ( C + D ) ) + D ) =/= ( ( ( A + B ) x. ( A + B ) ) + B ) )
8	7	necomd 2433	. . . . . . . . . . . 12 |- ( ( ph /\ ( A + B ) < ( C + D ) ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) )
9	8	ex 115	. . . . . . . . . . 11 |- ( ph -> ( ( A + B ) < ( C + D ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
10	1, 2	nn0addcld 9235	. . . . . . . . . . . 12 |- ( ph -> ( A + B ) e. NN0 )
11	3, 4, 10, 2	nn0opthlem2d 10703	. . . . . . . . . . 11 |- ( ph -> ( ( C + D ) < ( A + B ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
12	9, 11	jaod 717	. . . . . . . . . 10 |- ( ph -> ( ( ( A + B ) < ( C + D ) \/ ( C + D ) < ( A + B ) ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
13	10	nn0red 9232	. . . . . . . . . . 11 |- ( ph -> ( A + B ) e. RR )
14	5	nn0red 9232	. . . . . . . . . . 11 |- ( ph -> ( C + D ) e. RR )
15		reaplt 8547	. . . . . . . . . . 11 |- ( ( ( A + B ) e. RR /\ ( C + D ) e. RR ) -> ( ( A + B ) # ( C + D ) <-> ( ( A + B ) < ( C + D ) \/ ( C + D ) < ( A + B ) ) ) )
16	13, 14, 15	syl2anc 411	. . . . . . . . . 10 |- ( ph -> ( ( A + B ) # ( C + D ) <-> ( ( A + B ) < ( C + D ) \/ ( C + D ) < ( A + B ) ) ) )
17	10, 10	nn0mulcld 9236	. . . . . . . . . . . . 13 |- ( ph -> ( ( A + B ) x. ( A + B ) ) e. NN0 )
18	17, 2	nn0addcld 9235	. . . . . . . . . . . 12 |- ( ph -> ( ( ( A + B ) x. ( A + B ) ) + B ) e. NN0 )
19	18	nn0zd 9375	. . . . . . . . . . 11 |- ( ph -> ( ( ( A + B ) x. ( A + B ) ) + B ) e. ZZ )
20	5, 5	nn0mulcld 9236	. . . . . . . . . . . . 13 |- ( ph -> ( ( C + D ) x. ( C + D ) ) e. NN0 )
21	20, 4	nn0addcld 9235	. . . . . . . . . . . 12 |- ( ph -> ( ( ( C + D ) x. ( C + D ) ) + D ) e. NN0 )
22	21	nn0zd 9375	. . . . . . . . . . 11 |- ( ph -> ( ( ( C + D ) x. ( C + D ) ) + D ) e. ZZ )
23		zapne 9329	. . . . . . . . . . 11 |- ( ( ( ( ( A + B ) x. ( A + B ) ) + B ) e. ZZ /\ ( ( ( C + D ) x. ( C + D ) ) + D ) e. ZZ ) -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) <-> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
24	19, 22, 23	syl2anc 411	. . . . . . . . . 10 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) <-> ( ( ( A + B ) x. ( A + B ) ) + B ) =/= ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
25	12, 16, 24	3imtr4d 203	. . . . . . . . 9 |- ( ph -> ( ( A + B ) # ( C + D ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
26	25	con3d 631	. . . . . . . 8 |- ( ph -> ( -. ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) -> -. ( A + B ) # ( C + D ) ) )
27	18	nn0cnd 9233	. . . . . . . . 9 |- ( ph -> ( ( ( A + B ) x. ( A + B ) ) + B ) e. CC )
28	21	nn0cnd 9233	. . . . . . . . 9 |- ( ph -> ( ( ( C + D ) x. ( C + D ) ) + D ) e. CC )
29		apti 8581	. . . . . . . . 9 |- ( ( ( ( ( A + B ) x. ( A + B ) ) + B ) e. CC /\ ( ( ( C + D ) x. ( C + D ) ) + D ) e. CC ) -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) <-> -. ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
30	27, 28, 29	syl2anc 411	. . . . . . . 8 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) <-> -. ( ( ( A + B ) x. ( A + B ) ) + B ) # ( ( ( C + D ) x. ( C + D ) ) + D ) ) )
31	10	nn0cnd 9233	. . . . . . . . 9 |- ( ph -> ( A + B ) e. CC )
32	5	nn0cnd 9233	. . . . . . . . 9 |- ( ph -> ( C + D ) e. CC )
33		apti 8581	. . . . . . . . 9 |- ( ( ( A + B ) e. CC /\ ( C + D ) e. CC ) -> ( ( A + B ) = ( C + D ) <-> -. ( A + B ) # ( C + D ) ) )
34	31, 32, 33	syl2anc 411	. . . . . . . 8 |- ( ph -> ( ( A + B ) = ( C + D ) <-> -. ( A + B ) # ( C + D ) ) )
35	26, 30, 34	3imtr4d 203	. . . . . . 7 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) -> ( A + B ) = ( C + D ) ) )
36	35	imp 124	. . . . . 6 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( A + B ) = ( C + D ) )
37		simpr 110	. . . . . . . . 9 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) )
38	36, 36	oveq12d 5895	. . . . . . . . . 10 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( A + B ) x. ( A + B ) ) = ( ( C + D ) x. ( C + D ) ) )
39	38	oveq1d 5892	. . . . . . . . 9 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( ( A + B ) x. ( A + B ) ) + D ) = ( ( ( C + D ) x. ( C + D ) ) + D ) )
40	37, 39	eqtr4d 2213	. . . . . . . 8 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( A + B ) x. ( A + B ) ) + D ) )
41	31, 31	mulcld 7980	. . . . . . . . . 10 |- ( ph -> ( ( A + B ) x. ( A + B ) ) e. CC )
42	2	nn0cnd 9233	. . . . . . . . . 10 |- ( ph -> B e. CC )
43	4	nn0cnd 9233	. . . . . . . . . 10 |- ( ph -> D e. CC )
44	41, 42, 43	addcand 8143	. . . . . . . . 9 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( A + B ) x. ( A + B ) ) + D ) <-> B = D ) )
45	44	adantr 276	. . . . . . . 8 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( A + B ) x. ( A + B ) ) + D ) <-> B = D ) )
46	40, 45	mpbid 147	. . . . . . 7 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> B = D )
47	46	oveq2d 5893	. . . . . 6 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( C + B ) = ( C + D ) )
48	36, 47	eqtr4d 2213	. . . . 5 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( A + B ) = ( C + B ) )
49	1	nn0cnd 9233	. . . . . . 7 |- ( ph -> A e. CC )
50	3	nn0cnd 9233	. . . . . . 7 |- ( ph -> C e. CC )
51	49, 50, 42	addcan2d 8144	. . . . . 6 |- ( ph -> ( ( A + B ) = ( C + B ) <-> A = C ) )
52	51	adantr 276	. . . . 5 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( ( A + B ) = ( C + B ) <-> A = C ) )
53	48, 52	mpbid 147	. . . 4 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> A = C )
54	53, 46	jca 306	. . 3 |- ( ( ph /\ ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) ) -> ( A = C /\ B = D ) )
55	54	ex 115	. 2 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) -> ( A = C /\ B = D ) ) )
56		oveq12 5886	. . . 4 |- ( ( A = C /\ B = D ) -> ( A + B ) = ( C + D ) )
57	56, 56	oveq12d 5895	. . 3 |- ( ( A = C /\ B = D ) -> ( ( A + B ) x. ( A + B ) ) = ( ( C + D ) x. ( C + D ) ) )
58		simpr 110	. . 3 |- ( ( A = C /\ B = D ) -> B = D )
59	57, 58	oveq12d 5895	. 2 |- ( ( A = C /\ B = D ) -> ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) )
60	55, 59	impbid1 142	1 |- ( ph -> ( ( ( ( A + B ) x. ( A + B ) ) + B ) = ( ( ( C + D ) x. ( C + D ) ) + D ) <-> ( A = C /\ B = D ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 708   = wceq 1353   e. wcel 2148   =/= wne 2347   class class class wbr 4005  (class class class)co 5877   CCcc 7811   RRcr 7812   + caddc 7816   x. cmul 7818   < clt 7994   # cap 8540   NN0cn0 9178   ZZcz 9255

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-if 3537  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-po 4298  df-iso 4299  df-iord 4368  df-on 4370  df-ilim 4371  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-frec 6394  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632  df-inn 8922  df-2 8980  df-n0 9179  df-z 9256  df-uz 9531  df-seqfrec 10448  df-exp 10522

This theorem is referenced by:  nn0opth2d  10705