Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > numdensq | GIF version |
Description: Squaring a rational squares its canonical components. (Contributed by Stefan O'Rear, 15-Sep-2014.) |
Ref | Expression |
---|---|
numdensq | ⊢ (𝐴 ∈ ℚ → ((numer‘(𝐴↑2)) = ((numer‘𝐴)↑2) ∧ (denom‘(𝐴↑2)) = ((denom‘𝐴)↑2))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | qnumdencoprm 11871 | . . . 4 ⊢ (𝐴 ∈ ℚ → ((numer‘𝐴) gcd (denom‘𝐴)) = 1) | |
2 | 1 | oveq1d 5789 | . . 3 ⊢ (𝐴 ∈ ℚ → (((numer‘𝐴) gcd (denom‘𝐴))↑2) = (1↑2)) |
3 | qnumcl 11866 | . . . 4 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) ∈ ℤ) | |
4 | qdencl 11867 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
5 | 4 | nnzd 9172 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℤ) |
6 | zgcdsq 11879 | . . . 4 ⊢ (((numer‘𝐴) ∈ ℤ ∧ (denom‘𝐴) ∈ ℤ) → (((numer‘𝐴) gcd (denom‘𝐴))↑2) = (((numer‘𝐴)↑2) gcd ((denom‘𝐴)↑2))) | |
7 | 3, 5, 6 | syl2anc 408 | . . 3 ⊢ (𝐴 ∈ ℚ → (((numer‘𝐴) gcd (denom‘𝐴))↑2) = (((numer‘𝐴)↑2) gcd ((denom‘𝐴)↑2))) |
8 | sq1 10386 | . . . 4 ⊢ (1↑2) = 1 | |
9 | 8 | a1i 9 | . . 3 ⊢ (𝐴 ∈ ℚ → (1↑2) = 1) |
10 | 2, 7, 9 | 3eqtr3d 2180 | . 2 ⊢ (𝐴 ∈ ℚ → (((numer‘𝐴)↑2) gcd ((denom‘𝐴)↑2)) = 1) |
11 | qeqnumdivden 11872 | . . . 4 ⊢ (𝐴 ∈ ℚ → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) | |
12 | 11 | oveq1d 5789 | . . 3 ⊢ (𝐴 ∈ ℚ → (𝐴↑2) = (((numer‘𝐴) / (denom‘𝐴))↑2)) |
13 | 3 | zcnd 9174 | . . . 4 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) ∈ ℂ) |
14 | 4 | nncnd 8734 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℂ) |
15 | 4 | nnap0d 8766 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) # 0) |
16 | 13, 14, 15 | sqdivapd 10437 | . . 3 ⊢ (𝐴 ∈ ℚ → (((numer‘𝐴) / (denom‘𝐴))↑2) = (((numer‘𝐴)↑2) / ((denom‘𝐴)↑2))) |
17 | 12, 16 | eqtrd 2172 | . 2 ⊢ (𝐴 ∈ ℚ → (𝐴↑2) = (((numer‘𝐴)↑2) / ((denom‘𝐴)↑2))) |
18 | qsqcl 10364 | . . 3 ⊢ (𝐴 ∈ ℚ → (𝐴↑2) ∈ ℚ) | |
19 | zsqcl 10363 | . . . 4 ⊢ ((numer‘𝐴) ∈ ℤ → ((numer‘𝐴)↑2) ∈ ℤ) | |
20 | 3, 19 | syl 14 | . . 3 ⊢ (𝐴 ∈ ℚ → ((numer‘𝐴)↑2) ∈ ℤ) |
21 | 4 | nnsqcld 10445 | . . 3 ⊢ (𝐴 ∈ ℚ → ((denom‘𝐴)↑2) ∈ ℕ) |
22 | qnumdenbi 11870 | . . 3 ⊢ (((𝐴↑2) ∈ ℚ ∧ ((numer‘𝐴)↑2) ∈ ℤ ∧ ((denom‘𝐴)↑2) ∈ ℕ) → (((((numer‘𝐴)↑2) gcd ((denom‘𝐴)↑2)) = 1 ∧ (𝐴↑2) = (((numer‘𝐴)↑2) / ((denom‘𝐴)↑2))) ↔ ((numer‘(𝐴↑2)) = ((numer‘𝐴)↑2) ∧ (denom‘(𝐴↑2)) = ((denom‘𝐴)↑2)))) | |
23 | 18, 20, 21, 22 | syl3anc 1216 | . 2 ⊢ (𝐴 ∈ ℚ → (((((numer‘𝐴)↑2) gcd ((denom‘𝐴)↑2)) = 1 ∧ (𝐴↑2) = (((numer‘𝐴)↑2) / ((denom‘𝐴)↑2))) ↔ ((numer‘(𝐴↑2)) = ((numer‘𝐴)↑2) ∧ (denom‘(𝐴↑2)) = ((denom‘𝐴)↑2)))) |
24 | 10, 17, 23 | mpbi2and 927 | 1 ⊢ (𝐴 ∈ ℚ → ((numer‘(𝐴↑2)) = ((numer‘𝐴)↑2) ∧ (denom‘(𝐴↑2)) = ((denom‘𝐴)↑2))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 ‘cfv 5123 (class class class)co 5774 1c1 7621 / cdiv 8432 ℕcn 8720 2c2 8771 ℤcz 9054 ℚcq 9411 ↑cexp 10292 gcd cgcd 11635 numercnumer 11859 denomcdenom 11860 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 ax-arch 7739 ax-caucvg 7740 |
This theorem depends on definitions: df-bi 116 df-stab 816 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-sup 6871 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 df-div 8433 df-inn 8721 df-2 8779 df-3 8780 df-4 8781 df-n0 8978 df-z 9055 df-uz 9327 df-q 9412 df-rp 9442 df-fz 9791 df-fzo 9920 df-fl 10043 df-mod 10096 df-seqfrec 10219 df-exp 10293 df-cj 10614 df-re 10615 df-im 10616 df-rsqrt 10770 df-abs 10771 df-dvds 11494 df-gcd 11636 df-numer 11861 df-denom 11862 |
This theorem is referenced by: numsq 11881 densq 11882 |
Copyright terms: Public domain | W3C validator |