Theorem phplem3g 6926

Description: A natural number is equinumerous to its successor minus any element of the successor. Version of phplem3 6924 with unnecessary hypotheses removed. (Contributed by Jim Kingdon, 1-Sep-2021.)

Assertion

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

Proof of Theorem phplem3g

Dummy variables a b are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2259	. . . . 5 |- ( b = B -> ( b e. suc A <-> B e. suc A ) )
2	1	anbi2d 464	. . . 4 |- ( b = B -> ( ( A e. om /\ b e. suc A ) <-> ( A e. om /\ B e. suc A ) ) )
3		sneq 3634	. . . . . 6 |- ( b = B -> { b } = { B } )
4	3	difeq2d 3282	. . . . 5 |- ( b = B -> ( suc A \ { b } ) = ( suc A \ { B } ) )
5	4	breq2d 4046	. . . 4 |- ( b = B -> ( A ~~ ( suc A \ { b } ) <-> A ~~ ( suc A \ { B } ) ) )
6	2, 5	imbi12d 234	. . 3 |- ( b = B -> ( ( ( A e. om /\ b e. suc A ) -> A ~~ ( suc A \ { b } ) ) <-> ( ( A e. om /\ B e. suc A ) -> A ~~ ( suc A \ { B } ) ) ) )
7		eleq1 2259	. . . . . . 7 |- ( a = A -> ( a e. om <-> A e. om ) )
8		suceq 4438	. . . . . . . 8 |- ( a = A -> suc a = suc A )
9	8	eleq2d 2266	. . . . . . 7 |- ( a = A -> ( b e. suc a <-> b e. suc A ) )
10	7, 9	anbi12d 473	. . . . . 6 |- ( a = A -> ( ( a e. om /\ b e. suc a ) <-> ( A e. om /\ b e. suc A ) ) )
11		id 19	. . . . . . 7 |- ( a = A -> a = A )
12	8	difeq1d 3281	. . . . . . 7 |- ( a = A -> ( suc a \ { b } ) = ( suc A \ { b } ) )
13	11, 12	breq12d 4047	. . . . . 6 |- ( a = A -> ( a ~~ ( suc a \ { b } ) <-> A ~~ ( suc A \ { b } ) ) )
14	10, 13	imbi12d 234	. . . . 5 |- ( a = A -> ( ( ( a e. om /\ b e. suc a ) -> a ~~ ( suc a \ { b } ) ) <-> ( ( A e. om /\ b e. suc A ) -> A ~~ ( suc A \ { b } ) ) ) )
15		vex 2766	. . . . . 6 |- a e. _V
16		vex 2766	. . . . . 6 |- b e. _V
17	15, 16	phplem3 6924	. . . . 5 |- ( ( a e. om /\ b e. suc a ) -> a ~~ ( suc a \ { b } ) )
18	14, 17	vtoclg 2824	. . . 4 |- ( A e. om -> ( ( A e. om /\ b e. suc A ) -> A ~~ ( suc A \ { b } ) ) )
19	18	anabsi5 579	. . 3 |- ( ( A e. om /\ b e. suc A ) -> A ~~ ( suc A \ { b } ) )
20	6, 19	vtoclg 2824	. 2 |- ( B e. suc A -> ( ( A e. om /\ B e. suc A ) -> A ~~ ( suc A \ { B } ) ) )
21	20	anabsi7 581	1 |- ( ( A e. om /\ B e. suc A ) -> A ~~ ( suc A \ { B } ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   \ cdif 3154   {csn 3623   class class class wbr 4034   suc csuc 4401   omcom 4627   ~~ cen 6806

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-en 6809

This theorem is referenced by:  phplem4dom  6932  phpm  6935  phplem4on  6937