Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  congtr Structured version   Visualization version   GIF version

Theorem congtr 36440
Description: A wff of the form 𝐴 ∥ (𝐵𝐶) is interpreted as a congruential equation. This is similar to (𝐵 mod 𝐴) = (𝐶 mod 𝐴), but is defined such that behavior is regular for zero and negative values of 𝐴. To use this concept effectively, we need to show that congruential equations behave similarly to normal equations; first a transitivity law. Idea for the future: If there was a congruential equation symbol, it could incorporate type constraints, so that most of these would not need them. (Contributed by Stefan O'Rear, 1-Oct-2014.)
Assertion
Ref Expression
congtr (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐴 ∥ (𝐵𝐷))

Proof of Theorem congtr
StepHypRef Expression
1 simp1l 1077 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐴 ∈ ℤ)
2 simp1r 1078 . . . 4 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐵 ∈ ℤ)
3 simp2l 1079 . . . 4 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐶 ∈ ℤ)
42, 3zsubcld 11227 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → (𝐵𝐶) ∈ ℤ)
5 zsubcl 11160 . . . 4 ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝐶𝐷) ∈ ℤ)
653ad2ant2 1075 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → (𝐶𝐷) ∈ ℤ)
7 simp3 1055 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷)))
8 dvds2add 14722 . . . 4 ((𝐴 ∈ ℤ ∧ (𝐵𝐶) ∈ ℤ ∧ (𝐶𝐷) ∈ ℤ) → ((𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷)) → 𝐴 ∥ ((𝐵𝐶) + (𝐶𝐷))))
98imp 443 . . 3 (((𝐴 ∈ ℤ ∧ (𝐵𝐶) ∈ ℤ ∧ (𝐶𝐷) ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐴 ∥ ((𝐵𝐶) + (𝐶𝐷)))
101, 4, 6, 7, 9syl31anc 1320 . 2 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐴 ∥ ((𝐵𝐶) + (𝐶𝐷)))
11 zcn 11123 . . . . 5 (𝐵 ∈ ℤ → 𝐵 ∈ ℂ)
1211adantl 480 . . . 4 ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℂ)
13123ad2ant1 1074 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐵 ∈ ℂ)
14 zcn 11123 . . . . 5 (𝐶 ∈ ℤ → 𝐶 ∈ ℂ)
1514adantr 479 . . . 4 ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → 𝐶 ∈ ℂ)
16153ad2ant2 1075 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐶 ∈ ℂ)
17 zcn 11123 . . . . 5 (𝐷 ∈ ℤ → 𝐷 ∈ ℂ)
1817adantl 480 . . . 4 ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → 𝐷 ∈ ℂ)
19183ad2ant2 1075 . . 3 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐷 ∈ ℂ)
2013, 16, 19npncand 10167 . 2 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → ((𝐵𝐶) + (𝐶𝐷)) = (𝐵𝐷))
2110, 20breqtrd 4507 1 (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ (𝐴 ∥ (𝐵𝐶) ∧ 𝐴 ∥ (𝐶𝐷))) → 𝐴 ∥ (𝐵𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1030  wcel 1938   class class class wbr 4481  (class class class)co 6426  cc 9689   + caddc 9694  cmin 10017  cz 11118  cdvds 14690
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1700  ax-4 1713  ax-5 1793  ax-6 1838  ax-7 1885  ax-8 1940  ax-9 1947  ax-10 1966  ax-11 1971  ax-12 1983  ax-13 2137  ax-ext 2494  ax-sep 4607  ax-nul 4616  ax-pow 4668  ax-pr 4732  ax-un 6723  ax-resscn 9748  ax-1cn 9749  ax-icn 9750  ax-addcl 9751  ax-addrcl 9752  ax-mulcl 9753  ax-mulrcl 9754  ax-mulcom 9755  ax-addass 9756  ax-mulass 9757  ax-distr 9758  ax-i2m1 9759  ax-1ne0 9760  ax-1rid 9761  ax-rnegex 9762  ax-rrecex 9763  ax-cnre 9764  ax-pre-lttri 9765  ax-pre-lttrn 9766  ax-pre-ltadd 9767  ax-pre-mulgt0 9768
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1699  df-sb 1831  df-eu 2366  df-mo 2367  df-clab 2501  df-cleq 2507  df-clel 2510  df-nfc 2644  df-ne 2686  df-nel 2687  df-ral 2805  df-rex 2806  df-reu 2807  df-rab 2809  df-v 3079  df-sbc 3307  df-csb 3404  df-dif 3447  df-un 3449  df-in 3451  df-ss 3458  df-pss 3460  df-nul 3778  df-if 3940  df-pw 4013  df-sn 4029  df-pr 4031  df-tp 4033  df-op 4035  df-uni 4271  df-iun 4355  df-br 4482  df-opab 4542  df-mpt 4543  df-tr 4579  df-eprel 4843  df-id 4847  df-po 4853  df-so 4854  df-fr 4891  df-we 4893  df-xp 4938  df-rel 4939  df-cnv 4940  df-co 4941  df-dm 4942  df-rn 4943  df-res 4944  df-ima 4945  df-pred 5487  df-ord 5533  df-on 5534  df-lim 5535  df-suc 5536  df-iota 5653  df-fun 5691  df-fn 5692  df-f 5693  df-f1 5694  df-fo 5695  df-f1o 5696  df-fv 5697  df-riota 6388  df-ov 6429  df-oprab 6430  df-mpt2 6431  df-om 6834  df-wrecs 7169  df-recs 7231  df-rdg 7269  df-er 7505  df-en 7718  df-dom 7719  df-sdom 7720  df-pnf 9831  df-mnf 9832  df-xr 9833  df-ltxr 9834  df-le 9835  df-sub 10019  df-neg 10020  df-nn 10776  df-n0 11048  df-z 11119  df-dvds 14691
This theorem is referenced by:  congmul  36442  acongtr  36453  jm2.18  36463  jm2.27a  36480
  Copyright terms: Public domain W3C validator