Theorem ltfinirr 4458

Description: Irreflexive law for finite less than. (Contributed by SF, 29-Jan-2015.)

Assertion

Ref	Expression
ltfinirr	|- (A e. Nn -> -. <<A, A>> e. <fin )

Proof of Theorem ltfinirr

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0cnsuc 4402	. . . . . . . 8 |- (x +o 1c) =/= 0c
2	1	necomi 2599	. . . . . . 7 |- 0c =/= (x +o 1c)
3		df-ne 2519	. . . . . . 7 |- (0c =/= (x +o 1c) <-> -. 0c = (x +o 1c))
4	2, 3	mpbi 199	. . . . . 6 |- -. 0c = (x +o 1c)
5		addcid1 4406	. . . . . . . . 9 |- (A +o 0c) = A
6	5	eqcomi 2357	. . . . . . . 8 |- A = (A +o 0c)
7		addcass 4416	. . . . . . . 8 |- ((A +o x) +o 1c) = (A +o (x +o 1c))
8	6, 7	eqeq12i 2366	. . . . . . 7 |- (A = ((A +o x) +o 1c) <-> (A +o 0c) = (A +o (x +o 1c)))
9		simpll 730	. . . . . . . 8 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> A e. Nn )
10		peano1 4403	. . . . . . . . 9 |- 0c e. Nn
11	10	a1i 10	. . . . . . . 8 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> 0c e. Nn )
12		peano2 4404	. . . . . . . . 9 |- (x e. Nn -> (x +o 1c) e. Nn )
13	12	adantl 452	. . . . . . . 8 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> (x +o 1c) e. Nn )
14	5	neeq1i 2527	. . . . . . . . . 10 |- ((A +o 0c) =/= (/) <-> A =/= (/))
15	14	biimpri 197	. . . . . . . . 9 |- (A =/= (/) -> (A +o 0c) =/= (/))
16	15	ad2antlr 707	. . . . . . . 8 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> (A +o 0c) =/= (/))
17		preaddccan2 4456	. . . . . . . 8 |- (((A e. Nn /\ 0c e. Nn /\ (x +o 1c) e. Nn ) /\ (A +o 0c) =/= (/)) -> ((A +o 0c) = (A +o (x +o 1c)) <-> 0c = (x +o 1c)))
18	9, 11, 13, 16, 17	syl31anc 1185	. . . . . . 7 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> ((A +o 0c) = (A +o (x +o 1c)) <-> 0c = (x +o 1c)))
19	8, 18	syl5bb 248	. . . . . 6 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> (A = ((A +o x) +o 1c) <-> 0c = (x +o 1c)))
20	4, 19	mtbiri 294	. . . . 5 |- (((A e. Nn /\ A =/= (/)) /\ x e. Nn ) -> -. A = ((A +o x) +o 1c))
21	20	nrexdv 2718	. . . 4 |- ((A e. Nn /\ A =/= (/)) -> -. E.x e. Nn A = ((A +o x) +o 1c))
22	21	ex 423	. . 3 |- (A e. Nn -> (A =/= (/) -> -. E.x e. Nn A = ((A +o x) +o 1c)))
23		imnan 411	. . 3 |- ((A =/= (/) -> -. E.x e. Nn A = ((A +o x) +o 1c)) <-> -. (A =/= (/) /\ E.x e. Nn A = ((A +o x) +o 1c)))
24	22, 23	sylib 188	. 2 |- (A e. Nn -> -. (A =/= (/) /\ E.x e. Nn A = ((A +o x) +o 1c)))
25		opkltfing 4450	. . 3 |- ((A e. Nn /\ A e. Nn ) -> (<<A, A>> e. <fin <-> (A =/= (/) /\ E.x e. Nn A = ((A +o x) +o 1c))))
26	25	anidms 626	. 2 |- (A e. Nn -> (<<A, A>> e. <fin <-> (A =/= (/) /\ E.x e. Nn A = ((A +o x) +o 1c))))
27	24, 26	mtbird 292	1 |- (A e. Nn -> -. <<A, A>> e. <fin )

Syntax hints:  -. wn 3   -> wi 4   <-> wb 176   /\ wa 358   = wceq 1642   e. wcel 1710   =/= wne 2517  E.wrex 2616  (/)c0 3551  <<copk 4058  1_cc1c 4135   Nn cnnc 4374  0_cc0c 4375   +o cplc 4376   <_fin cltfin 4434

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-0c 4378  df-addc 4379  df-nnc 4380  df-ltfin 4442

This theorem is referenced by:  ltfinasym  4461  lenltfin  4470  tfinltfin  4502  sfin111  4537  vfinncvntnn  4549