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

Theorem nqnq0m 7668
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 7591 . . . 4 (𝐴Q → ∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
2 nqpi 7591 . . . 4 (𝐵Q → ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
31, 2anim12i 338 . . 3 ((𝐴Q𝐵Q) → (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
4 ee4anv 1985 . . 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 6022 . . . . . . 7 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q ) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ))
7 mulpiord 7530 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
87ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
9 mulpiord 7530 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
109ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
118, 10opeq12d 3868 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩ = ⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩)
1211eceq1d 6733 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
13 mulpipqqs 7586 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
14 mulclpi 7541 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) ∈ N)
1514ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) ∈ N)
16 mulclpi 7541 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) ∈ N)
1716ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) ∈ N)
18 nqnq0pi 7651 . . . . . . . . . 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 2265 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 )
21 pinn 7522 . . . . . . . . . 10 (𝑧N𝑧 ∈ ω)
2221anim1i 340 . . . . . . . . 9 ((𝑧N𝑤N) → (𝑧 ∈ ω ∧ 𝑤N))
23 pinn 7522 . . . . . . . . . 10 (𝑣N𝑣 ∈ ω)
2423anim1i 340 . . . . . . . . 9 ((𝑣N𝑢N) → (𝑣 ∈ ω ∧ 𝑢N))
25 mulnnnq0 7663 . . . . . . . . 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 2272 . . . . . . 7 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
286, 27sylan9eqr 2284 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
29 nqnq0pi 7651 . . . . . . . . . . 11 ((𝑧N𝑤N) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3029adantr 276 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3130eqeq2d 2241 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
32 nqnq0pi 7651 . . . . . . . . . . 11 ((𝑣N𝑢N) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3332adantl 277 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3433eqeq2d 2241 . . . . . . . . 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 6022 . . . . . . . 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 2265 . . . . 5 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4140an4s 590 . . . 4 ((((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4241exlimivv 1943 . . 3 (∃𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4342exlimivv 1943 . 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 1395  wex 1538  wcel 2200  cop 3670  ωcom 4686  (class class class)co 6013   ·o comu 6575  [cec 6695  Ncnpi 7485   ·N cmi 7487   ~Q ceq 7492  Qcnq 7493   ·Q cmq 7496   ~Q0 ceq0 7499   ·Q0 cmq0 7503
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7517  df-mi 7519  df-mpq 7558  df-enq 7560  df-nqqs 7561  df-mqqs 7563  df-enq0 7637  df-nq0 7638  df-mq0 7641
This theorem is referenced by:  prarloclemlo  7707  prarloclemcalc  7715
  Copyright terms: Public domain W3C validator