![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 2lgsoddprmlem1 | GIF version |
Description: Lemma 1 for 2lgsoddprm . (Contributed by AV, 19-Jul-2021.) |
Ref | Expression |
---|---|
2lgsoddprmlem1 | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → (((𝑁↑2) − 1) / 8) = (((8 · (𝐴↑2)) + (2 · (𝐴 · 𝐵))) + (((𝐵↑2) − 1) / 8))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 5902 | . . . . 5 ⊢ (𝑁 = ((8 · 𝐴) + 𝐵) → (𝑁↑2) = (((8 · 𝐴) + 𝐵)↑2)) | |
2 | 1 | 3ad2ant3 1022 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → (𝑁↑2) = (((8 · 𝐴) + 𝐵)↑2)) |
3 | 2 | oveq1d 5910 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → ((𝑁↑2) − 1) = ((((8 · 𝐴) + 𝐵)↑2) − 1)) |
4 | 3 | oveq1d 5910 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → (((𝑁↑2) − 1) / 8) = (((((8 · 𝐴) + 𝐵)↑2) − 1) / 8)) |
5 | zcn 9287 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
6 | 5 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℂ) |
7 | zcn 9287 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ) | |
8 | 7 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℂ) |
9 | 1cnd 8002 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 1 ∈ ℂ) | |
10 | 8cn 9034 | . . . . . 6 ⊢ 8 ∈ ℂ | |
11 | 8re 9033 | . . . . . . 7 ⊢ 8 ∈ ℝ | |
12 | 8pos 9051 | . . . . . . 7 ⊢ 0 < 8 | |
13 | 11, 12 | gt0ap0ii 8614 | . . . . . 6 ⊢ 8 # 0 |
14 | 10, 13 | pm3.2i 272 | . . . . 5 ⊢ (8 ∈ ℂ ∧ 8 # 0) |
15 | 14 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (8 ∈ ℂ ∧ 8 # 0)) |
16 | mulsubdivbinom2ap 10722 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 1 ∈ ℂ) ∧ (8 ∈ ℂ ∧ 8 # 0)) → (((((8 · 𝐴) + 𝐵)↑2) − 1) / 8) = (((8 · (𝐴↑2)) + (2 · (𝐴 · 𝐵))) + (((𝐵↑2) − 1) / 8))) | |
17 | 6, 8, 9, 15, 16 | syl31anc 1252 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (((((8 · 𝐴) + 𝐵)↑2) − 1) / 8) = (((8 · (𝐴↑2)) + (2 · (𝐴 · 𝐵))) + (((𝐵↑2) − 1) / 8))) |
18 | 17 | 3adant3 1019 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → (((((8 · 𝐴) + 𝐵)↑2) − 1) / 8) = (((8 · (𝐴↑2)) + (2 · (𝐴 · 𝐵))) + (((𝐵↑2) − 1) / 8))) |
19 | 4, 18 | eqtrd 2222 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝑁 = ((8 · 𝐴) + 𝐵)) → (((𝑁↑2) − 1) / 8) = (((8 · (𝐴↑2)) + (2 · (𝐴 · 𝐵))) + (((𝐵↑2) − 1) / 8))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 class class class wbr 4018 (class class class)co 5895 ℂcc 7838 0cc0 7840 1c1 7841 + caddc 7843 · cmul 7845 − cmin 8157 # cap 8567 / cdiv 8658 2c2 8999 8c8 9005 ℤcz 9282 ↑cexp 10549 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-iinf 4605 ax-cnex 7931 ax-resscn 7932 ax-1cn 7933 ax-1re 7934 ax-icn 7935 ax-addcl 7936 ax-addrcl 7937 ax-mulcl 7938 ax-mulrcl 7939 ax-addcom 7940 ax-mulcom 7941 ax-addass 7942 ax-mulass 7943 ax-distr 7944 ax-i2m1 7945 ax-0lt1 7946 ax-1rid 7947 ax-0id 7948 ax-rnegex 7949 ax-precex 7950 ax-cnre 7951 ax-pre-ltirr 7952 ax-pre-ltwlin 7953 ax-pre-lttrn 7954 ax-pre-apti 7955 ax-pre-ltadd 7956 ax-pre-mulgt0 7957 ax-pre-mulext 7958 |
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 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4311 df-po 4314 df-iso 4315 df-iord 4384 df-on 4386 df-ilim 4387 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5851 df-ov 5898 df-oprab 5899 df-mpo 5900 df-1st 6164 df-2nd 6165 df-recs 6329 df-frec 6415 df-pnf 8023 df-mnf 8024 df-xr 8025 df-ltxr 8026 df-le 8027 df-sub 8159 df-neg 8160 df-reap 8561 df-ap 8568 df-div 8659 df-inn 8949 df-2 9007 df-3 9008 df-4 9009 df-5 9010 df-6 9011 df-7 9012 df-8 9013 df-n0 9206 df-z 9283 df-uz 9558 df-seqfrec 10476 df-exp 10550 |
This theorem is referenced by: 2lgsoddprmlem2 14907 |
Copyright terms: Public domain | W3C validator |