Theorem rerecclap 8888

Description: Closure law for reciprocal. (Contributed by Jim Kingdon, 26-Feb-2020.)

Assertion

Ref	Expression
rerecclap	|- ( ( A e. RR /\ A # 0 ) -> ( 1 / A ) e. RR )

Proof of Theorem rerecclap

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0re 8157	. . . . . 6 |- 0 e. RR
2		apreap 8745	. . . . . 6 |- ( ( A e. RR /\ 0 e. RR ) -> ( A # 0 <-> A #ℝ 0 ) )
3	1, 2	mpan2 425	. . . . 5 |- ( A e. RR -> ( A # 0 <-> A #ℝ 0 ) )
4	3	pm5.32i 454	. . . 4 |- ( ( A e. RR /\ A # 0 ) <-> ( A e. RR /\ A #ℝ 0 ) )
5		recexre 8736	. . . 4 |- ( ( A e. RR /\ A #ℝ 0 ) -> E. x e. RR ( A x. x ) = 1 )
6	4, 5	sylbi 121	. . 3 |- ( ( A e. RR /\ A # 0 ) -> E. x e. RR ( A x. x ) = 1 )
7		eqcom 2231	. . . . 5 |- ( x = ( 1 / A ) <-> ( 1 / A ) = x )
8		1cnd 8173	. . . . . 6 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> 1 e. CC )
9		simpr 110	. . . . . . 7 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> x e. RR )
10	9	recnd 8186	. . . . . 6 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> x e. CC )
11		simpll 527	. . . . . . 7 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> A e. RR )
12	11	recnd 8186	. . . . . 6 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> A e. CC )
13		simplr 528	. . . . . 6 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> A # 0 )
14		divmulap 8833	. . . . . 6 |- ( ( 1 e. CC /\ x e. CC /\ ( A e. CC /\ A # 0 ) ) -> ( ( 1 / A ) = x <-> ( A x. x ) = 1 ) )
15	8, 10, 12, 13, 14	syl112anc 1275	. . . . 5 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> ( ( 1 / A ) = x <-> ( A x. x ) = 1 ) )
16	7, 15	bitrid 192	. . . 4 |- ( ( ( A e. RR /\ A # 0 ) /\ x e. RR ) -> ( x = ( 1 / A ) <-> ( A x. x ) = 1 ) )
17	16	rexbidva 2527	. . 3 |- ( ( A e. RR /\ A # 0 ) -> ( E. x e. RR x = ( 1 / A ) <-> E. x e. RR ( A x. x ) = 1 ) )
18	6, 17	mpbird 167	. 2 |- ( ( A e. RR /\ A # 0 ) -> E. x e. RR x = ( 1 / A ) )
19		risset 2558	. 2 |- ( ( 1 / A ) e. RR <-> E. x e. RR x = ( 1 / A ) )
20	18, 19	sylibr 134	1 |- ( ( A e. RR /\ A # 0 ) -> ( 1 / A ) e. RR )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1395   e. wcel 2200   E.wrex 2509   class class class wbr 4083  (class class class)co 6007   CCcc 8008   RRcr 8009   0cc0 8010   1c1 8011   x. cmul 8015   #_ℝ creap 8732   # cap 8739   / cdiv 8830

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-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128

This theorem depends on definitions:  df-bi 117  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-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831

This theorem is referenced by:  redivclap  8889  rerecclapzi  8934  rerecclapd  8992  rerecapb  9001  ltdiv2  9045  recnz  9551  reexpclzap  10793  redivap  11401  imdivap  11408  caucvgrelemrec  11506  trirec0  16500