ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nqnq0m GIF version

Theorem nqnq0m 7517
Description: Multiplication of positive fractions is equal with ·Q or ·Q0. (Contributed by Jim Kingdon, 10-Nov-2019.)
Assertion
Ref Expression
nqnq0m ((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))

Proof of Theorem nqnq0m
Dummy variables 𝑧 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nqpi 7440 . . . 4 (𝐴Q → ∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
2 nqpi 7440 . . . 4 (𝐵Q → ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
31, 2anim12i 338 . . 3 ((𝐴Q𝐵Q) → (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
4 ee4anv 1950 . . 3 (∃𝑧𝑤𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) ↔ (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
53, 4sylibr 134 . 2 ((𝐴Q𝐵Q) → ∃𝑧𝑤𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
6 oveq12 5928 . . . . . . 7 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q ) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ))
7 mulpiord 7379 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
87ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
9 mulpiord 7379 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
109ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
118, 10opeq12d 3813 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩ = ⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩)
1211eceq1d 6625 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
13 mulpipqqs 7435 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
14 mulclpi 7390 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) ∈ N)
1514ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) ∈ N)
16 mulclpi 7390 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) ∈ N)
1716ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) ∈ N)
18 nqnq0pi 7500 . . . . . . . . . 10 (((𝑧 ·N 𝑣) ∈ N ∧ (𝑤 ·N 𝑢) ∈ N) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
1915, 17, 18syl2anc 411 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
2013, 19eqtr4d 2229 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 )
21 pinn 7371 . . . . . . . . . 10 (𝑧N𝑧 ∈ ω)
2221anim1i 340 . . . . . . . . 9 ((𝑧N𝑤N) → (𝑧 ∈ ω ∧ 𝑤N))
23 pinn 7371 . . . . . . . . . 10 (𝑣N𝑣 ∈ ω)
2423anim1i 340 . . . . . . . . 9 ((𝑣N𝑢N) → (𝑣 ∈ ω ∧ 𝑢N))
25 mulnnnq0 7512 . . . . . . . . 9 (((𝑧 ∈ ω ∧ 𝑤N) ∧ (𝑣 ∈ ω ∧ 𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ) = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
2622, 24, 25syl2an 289 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ) = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
2712, 20, 263eqtr4d 2236 . . . . . . 7 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
286, 27sylan9eqr 2248 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
29 nqnq0pi 7500 . . . . . . . . . . 11 ((𝑧N𝑤N) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3029adantr 276 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3130eqeq2d 2205 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
32 nqnq0pi 7500 . . . . . . . . . . 11 ((𝑣N𝑢N) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3332adantl 277 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3433eqeq2d 2205 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐵 = [⟨𝑣, 𝑢⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
3531, 34anbi12d 473 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 ) ↔ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
3635pm5.32i 454 . . . . . . 7 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 )) ↔ (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
37 oveq12 5928 . . . . . . . 8 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 ) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
3837adantl 277 . . . . . . 7 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 )) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
3936, 38sylbir 135 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
4028, 39eqtr4d 2229 . . . . 5 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4140an4s 588 . . . 4 ((((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4241exlimivv 1908 . . 3 (∃𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4342exlimivv 1908 . 2 (∃𝑧𝑤𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
445, 43syl 14 1 ((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wex 1503  wcel 2164  cop 3622  ωcom 4623  (class class class)co 5919   ·o comu 6469  [cec 6587  Ncnpi 7334   ·N cmi 7336   ~Q ceq 7341  Qcnq 7342   ·Q cmq 7345   ~Q0 ceq0 7348   ·Q0 cmq0 7352
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 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621
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 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-oadd 6475  df-omul 6476  df-er 6589  df-ec 6591  df-qs 6595  df-ni 7366  df-mi 7368  df-mpq 7407  df-enq 7409  df-nqqs 7410  df-mqqs 7412  df-enq0 7486  df-nq0 7487  df-mq0 7490
This theorem is referenced by:  prarloclemlo  7556  prarloclemcalc  7564
  Copyright terms: Public domain W3C validator