Metamath Proof Explorer


Theorem expcl2lem

Description: Lemma for proving integer exponentiation closure laws. (Contributed by Mario Carneiro, 4-Jun-2014) (Revised by Mario Carneiro, 9-Sep-2014)

Ref Expression
Hypotheses expcllem.1 F
expcllem.2 x F y F x y F
expcllem.3 1 F
expcl2lem.4 x F x 0 1 x F
Assertion expcl2lem A F A 0 B A B F

Proof

Step Hyp Ref Expression
1 expcllem.1 F
2 expcllem.2 x F y F x y F
3 expcllem.3 1 F
4 expcl2lem.4 x F x 0 1 x F
5 elznn0nn B B 0 B B
6 1 2 3 expcllem A F B 0 A B F
7 6 ex A F B 0 A B F
8 7 adantr A F A 0 B 0 A B F
9 simpll A F A 0 B B A F
10 1 9 sselid A F A 0 B B A
11 simprl A F A 0 B B B
12 11 recnd A F A 0 B B B
13 nnnn0 B B 0
14 13 ad2antll A F A 0 B B B 0
15 expneg2 A B B 0 A B = 1 A B
16 10 12 14 15 syl3anc A F A 0 B B A B = 1 A B
17 difss F 0 F
18 eldifsn A F 0 A F A 0
19 18 biranri A F A 0 B B A F 0
20 17 1 sstri F 0
21 17 sseli x F 0 x F
22 17 sseli y F 0 y F
23 21 22 2 syl2an x F 0 y F 0 x y F
24 eldifsn x F 0 x F x 0
25 1 sseli x F x
26 25 anim1i x F x 0 x x 0
27 24 26 sylbi x F 0 x x 0
28 eldifsn y F 0 y F y 0
29 1 sseli y F y
30 29 anim1i y F y 0 y y 0
31 28 30 sylbi y F 0 y y 0
32 mulne0 x x 0 y y 0 x y 0
33 27 31 32 syl2an x F 0 y F 0 x y 0
34 eldifsn x y F 0 x y F x y 0
35 23 33 34 sylanbrc x F 0 y F 0 x y F 0
36 ax-1ne0 1 0
37 eldifsn 1 F 0 1 F 1 0
38 3 36 37 mpbir2an 1 F 0
39 20 35 38 expcllem A F 0 B 0 A B F 0
40 19 14 39 syl2anc A F A 0 B B A B F 0
41 17 40 sselid A F A 0 B B A B F
42 eldifsn A B F 0 A B F A B 0
43 40 42 sylib A F A 0 B B A B F A B 0
44 43 simprd A F A 0 B B A B 0
45 neeq1 x = A B x 0 A B 0
46 oveq2 x = A B 1 x = 1 A B
47 46 eleq1d x = A B 1 x F 1 A B F
48 45 47 imbi12d x = A B x 0 1 x F A B 0 1 A B F
49 4 ex x F x 0 1 x F
50 48 49 vtoclga A B F A B 0 1 A B F
51 41 44 50 sylc A F A 0 B B 1 A B F
52 16 51 eqeltrd A F A 0 B B A B F
53 52 ex A F A 0 B B A B F
54 8 53 jaod A F A 0 B 0 B B A B F
55 5 54 biimtrid A F A 0 B A B F
56 55 3impia A F A 0 B A B F