Theorem phplem2 7022

Description: Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus one of its elements. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 16-Nov-2014.)

Hypotheses

Ref	Expression
phplem2.1	|- A e. _V
phplem2.2	|- B e. _V

Assertion

Ref	Expression
phplem2	|- ( ( A e. om /\ B e. A ) -> A ~~ ( suc A \ { B } ) )

Proof of Theorem phplem2

Step	Hyp	Ref	Expression
1		phplem2.2	. . . . . . . 8 |- B e. _V
2		phplem2.1	. . . . . . . 8 |- A e. _V
3	1, 2	opex 4315	. . . . . . 7 |- <. B , A >. e. _V
4	3	snex 4269	. . . . . 6 |- { <. B , A >. } e. _V
5	1, 2	f1osn 5615	. . . . . 6 |- { <. B , A >. } : { B } -1-1-onto-> { A }
6		f1oen3g 6913	. . . . . 6 |- ( ( { <. B , A >. } e. _V /\ { <. B , A >. } : { B } -1-1-onto-> { A } ) -> { B } ~~ { A } )
7	4, 5, 6	mp2an 426	. . . . 5 |- { B } ~~ { A }
8		difss 3330	. . . . . . 7 |- ( A \ { B } ) C_ A
9	2, 8	ssexi 4222	. . . . . 6 |- ( A \ { B } ) e. _V
10	9	enref 6924	. . . . 5 |- ( A \ { B } ) ~~ ( A \ { B } )
11	7, 10	pm3.2i 272	. . . 4 |- ( { B } ~~ { A } /\ ( A \ { B } ) ~~ ( A \ { B } ) )
12		incom 3396	. . . . . 6 |- ( { A } i^i ( A \ { B } ) ) = ( ( A \ { B } ) i^i { A } )
13		ssrin 3429	. . . . . . . . 9 |- ( ( A \ { B } ) C_ A -> ( ( A \ { B } ) i^i { A } ) C_ ( A i^i { A } ) )
14	8, 13	ax-mp 5	. . . . . . . 8 |- ( ( A \ { B } ) i^i { A } ) C_ ( A i^i { A } )
15		nnord 4704	. . . . . . . . 9 |- ( A e. om -> Ord A )
16		orddisj 4638	. . . . . . . . 9 |- ( Ord A -> ( A i^i { A } ) = (/) )
17	15, 16	syl 14	. . . . . . . 8 |- ( A e. om -> ( A i^i { A } ) = (/) )
18	14, 17	sseqtrid 3274	. . . . . . 7 |- ( A e. om -> ( ( A \ { B } ) i^i { A } ) C_ (/) )
19		ss0 3532	. . . . . . 7 |- ( ( ( A \ { B } ) i^i { A } ) C_ (/) -> ( ( A \ { B } ) i^i { A } ) = (/) )
20	18, 19	syl 14	. . . . . 6 |- ( A e. om -> ( ( A \ { B } ) i^i { A } ) = (/) )
21	12, 20	eqtrid 2274	. . . . 5 |- ( A e. om -> ( { A } i^i ( A \ { B } ) ) = (/) )
22		disjdif 3564	. . . . 5 |- ( { B } i^i ( A \ { B } ) ) = (/)
23	21, 22	jctil 312	. . . 4 |- ( A e. om -> ( ( { B } i^i ( A \ { B } ) ) = (/) /\ ( { A } i^i ( A \ { B } ) ) = (/) ) )
24		unen 6977	. . . 4 |- ( ( ( { B } ~~ { A } /\ ( A \ { B } ) ~~ ( A \ { B } ) ) /\ ( ( { B } i^i ( A \ { B } ) ) = (/) /\ ( { A } i^i ( A \ { B } ) ) = (/) ) ) -> ( { B } u. ( A \ { B } ) ) ~~ ( { A } u. ( A \ { B } ) ) )
25	11, 23, 24	sylancr 414	. . 3 |- ( A e. om -> ( { B } u. ( A \ { B } ) ) ~~ ( { A } u. ( A \ { B } ) ) )
26	25	adantr 276	. 2 |- ( ( A e. om /\ B e. A ) -> ( { B } u. ( A \ { B } ) ) ~~ ( { A } u. ( A \ { B } ) ) )
27		uncom 3348	. . 3 |- ( { B } u. ( A \ { B } ) ) = ( ( A \ { B } ) u. { B } )
28		nndifsnid 6661	. . 3 |- ( ( A e. om /\ B e. A ) -> ( ( A \ { B } ) u. { B } ) = A )
29	27, 28	eqtrid 2274	. 2 |- ( ( A e. om /\ B e. A ) -> ( { B } u. ( A \ { B } ) ) = A )
30		phplem1 7021	. 2 |- ( ( A e. om /\ B e. A ) -> ( { A } u. ( A \ { B } ) ) = ( suc A \ { B } ) )
31	26, 29, 30	3brtr3d 4114	1 |- ( ( A e. om /\ B e. A ) -> A ~~ ( suc A \ { B } ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   _Vcvv 2799   \ cdif 3194   u. cun 3195   i^i cin 3196   C_ wss 3197   (/)c0 3491   {csn 3666   <.cop 3669   class class class wbr 4083   Ord word 4453   suc csuc 4456   omcom 4682   -1-1-onto->wf1o 5317   ~~ cen 6893

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-en 6896

This theorem is referenced by:  phplem3  7023