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

Theorem nqnq0m 7396
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 7319 . . . 4 (𝐴Q → ∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
2 nqpi 7319 . . . 4 (𝐵Q → ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
31, 2anim12i 336 . . 3 ((𝐴Q𝐵Q) → (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
4 ee4anv 1922 . . 3 (∃𝑧𝑤𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) ↔ (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
53, 4sylibr 133 . 2 ((𝐴Q𝐵Q) → ∃𝑧𝑤𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
6 oveq12 5851 . . . . . . 7 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q ) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ))
7 mulpiord 7258 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
87ad2ant2r 501 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
9 mulpiord 7258 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
109ad2ant2l 500 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
118, 10opeq12d 3766 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩ = ⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩)
1211eceq1d 6537 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
13 mulpipqqs 7314 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
14 mulclpi 7269 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) ∈ N)
1514ad2ant2r 501 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) ∈ N)
16 mulclpi 7269 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) ∈ N)
1716ad2ant2l 500 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) ∈ N)
18 nqnq0pi 7379 . . . . . . . . . 10 (((𝑧 ·N 𝑣) ∈ N ∧ (𝑤 ·N 𝑢) ∈ N) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
1915, 17, 18syl2anc 409 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
2013, 19eqtr4d 2201 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 )
21 pinn 7250 . . . . . . . . . 10 (𝑧N𝑧 ∈ ω)
2221anim1i 338 . . . . . . . . 9 ((𝑧N𝑤N) → (𝑧 ∈ ω ∧ 𝑤N))
23 pinn 7250 . . . . . . . . . 10 (𝑣N𝑣 ∈ ω)
2423anim1i 338 . . . . . . . . 9 ((𝑣N𝑢N) → (𝑣 ∈ ω ∧ 𝑢N))
25 mulnnnq0 7391 . . . . . . . . 9 (((𝑧 ∈ ω ∧ 𝑤N) ∧ (𝑣 ∈ ω ∧ 𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ) = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
2622, 24, 25syl2an 287 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ) = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
2712, 20, 263eqtr4d 2208 . . . . . . 7 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
286, 27sylan9eqr 2221 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
29 nqnq0pi 7379 . . . . . . . . . . 11 ((𝑧N𝑤N) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3029adantr 274 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3130eqeq2d 2177 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
32 nqnq0pi 7379 . . . . . . . . . . 11 ((𝑣N𝑢N) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3332adantl 275 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3433eqeq2d 2177 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐵 = [⟨𝑣, 𝑢⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
3531, 34anbi12d 465 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 ) ↔ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
3635pm5.32i 450 . . . . . . 7 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 )) ↔ (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
37 oveq12 5851 . . . . . . . 8 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 ) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
3837adantl 275 . . . . . . 7 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐵 = [⟨𝑣, 𝑢⟩] ~Q0 )) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
3936, 38sylbir 134 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q0 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
4028, 39eqtr4d 2201 . . . . 5 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4140an4s 578 . . . 4 ((((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4241exlimivv 1884 . . 3 (∃𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4342exlimivv 1884 . 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 103   = wceq 1343  wex 1480  wcel 2136  cop 3579  ωcom 4567  (class class class)co 5842   ·o comu 6382  [cec 6499  Ncnpi 7213   ·N cmi 7215   ~Q ceq 7220  Qcnq 7221   ·Q cmq 7224   ~Q0 ceq0 7227   ·Q0 cmq0 7231
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-mi 7247  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-mqqs 7291  df-enq0 7365  df-nq0 7366  df-mq0 7369
This theorem is referenced by:  prarloclemlo  7435  prarloclemcalc  7443
  Copyright terms: Public domain W3C validator