Theorem recexprlemex 8010

Description: B is the reciprocal of A. Lemma for recexpr 8011. (Contributed by Jim Kingdon, 27-Dec-2019.)

Hypothesis

Ref	Expression
recexpr.1	|- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.

Assertion

Ref	Expression
recexprlemex	|- ( A e. P. -> ( A .P. B ) = 1P )

Distinct variable groups:   x, y, A   x, B, y

Proof of Theorem recexprlemex

Step	Hyp	Ref	Expression
1		recexpr.1	. . . 4 |- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.
2	1	recexprlemss1l 8008	. . 3 |- ( A e. P. -> ( 1st ` ( A .P. B ) ) C_ ( 1st ` 1P ) )
3	1	recexprlem1ssl 8006	. . 3 |- ( A e. P. -> ( 1st ` 1P ) C_ ( 1st ` ( A .P. B ) ) )
4	2, 3	eqssd 3265	. 2 |- ( A e. P. -> ( 1st ` ( A .P. B ) ) = ( 1st ` 1P ) )
5	1	recexprlemss1u 8009	. . 3 |- ( A e. P. -> ( 2nd ` ( A .P. B ) ) C_ ( 2nd ` 1P ) )
6	1	recexprlem1ssu 8007	. . 3 |- ( A e. P. -> ( 2nd ` 1P ) C_ ( 2nd ` ( A .P. B ) ) )
7	5, 6	eqssd 3265	. 2 |- ( A e. P. -> ( 2nd ` ( A .P. B ) ) = ( 2nd ` 1P ) )
8	1	recexprlempr 8005	. . . 4 |- ( A e. P. -> B e. P. )
9		mulclpr 7945	. . . 4 |- ( ( A e. P. /\ B e. P. ) -> ( A .P. B ) e. P. )
10	8, 9	mpdan 425	. . 3 |- ( A e. P. -> ( A .P. B ) e. P. )
11		1pr 7927	. . 3 |- 1P e. P.
12		preqlu 7845	. . 3 |- ( ( ( A .P. B ) e. P. /\ 1P e. P. ) -> ( ( A .P. B ) = 1P <-> ( ( 1st ` ( A .P. B ) ) = ( 1st ` 1P ) /\ ( 2nd ` ( A .P. B ) ) = ( 2nd ` 1P ) ) ) )
13	10, 11, 12	sylancl 417	. 2 |- ( A e. P. -> ( ( A .P. B ) = 1P <-> ( ( 1st ` ( A .P. B ) ) = ( 1st ` 1P ) /\ ( 2nd ` ( A .P. B ) ) = ( 2nd ` 1P ) ) ) )
14	4, 7, 13	mpbir2and 957	1 |- ( A e. P. -> ( A .P. B ) = 1P )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   E.wex 1545   e. wcel 2209   {cab 2224   <.cop 3712   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   1stc1st 6376   2ndc2nd 6377   *Qcrq 7657   <Q cltq 7658   P.cnp 7664   1Pc1p 7665   .P. cmp 7667

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-enq0 7797  df-nq0 7798  df-0nq0 7799  df-plq0 7800  df-mq0 7801  df-inp 7839  df-i1p 7840  df-imp 7842

This theorem is used by:  recexpr  8011