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

Theorem nqnq0m 7445
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 7368 . . . 4 (𝐴Q → ∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
2 nqpi 7368 . . . 4 (𝐵Q → ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q ))
31, 2anim12i 338 . . 3 ((𝐴Q𝐵Q) → (∃𝑧𝑤((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ∃𝑣𝑢((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )))
4 ee4anv 1934 . . 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 5878 . . . . . . 7 ((𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q ) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ))
7 mulpiord 7307 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
87ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) = (𝑧 ·o 𝑣))
9 mulpiord 7307 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
109ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) = (𝑤 ·o 𝑢))
118, 10opeq12d 3784 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩ = ⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩)
1211eceq1d 6565 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 = [⟨(𝑧 ·o 𝑣), (𝑤 ·o 𝑢)⟩] ~Q0 )
13 mulpipqqs 7363 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q )
14 mulclpi 7318 . . . . . . . . . . 11 ((𝑧N𝑣N) → (𝑧 ·N 𝑣) ∈ N)
1514ad2ant2r 509 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑧 ·N 𝑣) ∈ N)
16 mulclpi 7318 . . . . . . . . . . 11 ((𝑤N𝑢N) → (𝑤 ·N 𝑢) ∈ N)
1716ad2ant2l 508 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝑤 ·N 𝑢) ∈ N)
18 nqnq0pi 7428 . . . . . . . . . 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 2213 . . . . . . . 8 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = [⟨(𝑧 ·N 𝑣), (𝑤 ·N 𝑢)⟩] ~Q0 )
21 pinn 7299 . . . . . . . . . 10 (𝑧N𝑧 ∈ ω)
2221anim1i 340 . . . . . . . . 9 ((𝑧N𝑤N) → (𝑧 ∈ ω ∧ 𝑤N))
23 pinn 7299 . . . . . . . . . 10 (𝑣N𝑣 ∈ ω)
2423anim1i 340 . . . . . . . . 9 ((𝑣N𝑢N) → (𝑣 ∈ ω ∧ 𝑢N))
25 mulnnnq0 7440 . . . . . . . . 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 2220 . . . . . . 7 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → ([⟨𝑧, 𝑤⟩] ~Q ·Q [⟨𝑣, 𝑢⟩] ~Q ) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
286, 27sylan9eqr 2232 . . . . . 6 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = ([⟨𝑧, 𝑤⟩] ~Q0 ·Q0 [⟨𝑣, 𝑢⟩] ~Q0 ))
29 nqnq0pi 7428 . . . . . . . . . . 11 ((𝑧N𝑤N) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3029adantr 276 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑧, 𝑤⟩] ~Q0 = [⟨𝑧, 𝑤⟩] ~Q )
3130eqeq2d 2189 . . . . . . . . 9 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → (𝐴 = [⟨𝑧, 𝑤⟩] ~Q0𝐴 = [⟨𝑧, 𝑤⟩] ~Q ))
32 nqnq0pi 7428 . . . . . . . . . . 11 ((𝑣N𝑢N) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3332adantl 277 . . . . . . . . . 10 (((𝑧N𝑤N) ∧ (𝑣N𝑢N)) → [⟨𝑣, 𝑢⟩] ~Q0 = [⟨𝑣, 𝑢⟩] ~Q )
3433eqeq2d 2189 . . . . . . . . 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 5878 . . . . . . . 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 2213 . . . . 5 ((((𝑧N𝑤N) ∧ (𝑣N𝑢N)) ∧ (𝐴 = [⟨𝑧, 𝑤⟩] ~Q𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4140an4s 588 . . . 4 ((((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4241exlimivv 1896 . . 3 (∃𝑣𝑢(((𝑧N𝑤N) ∧ 𝐴 = [⟨𝑧, 𝑤⟩] ~Q ) ∧ ((𝑣N𝑢N) ∧ 𝐵 = [⟨𝑣, 𝑢⟩] ~Q )) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
4342exlimivv 1896 . 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 1353  wex 1492  wcel 2148  cop 3594  ωcom 4586  (class class class)co 5869   ·o comu 6409  [cec 6527  Ncnpi 7262   ·N cmi 7264   ~Q ceq 7269  Qcnq 7270   ·Q cmq 7273   ~Q0 ceq0 7276   ·Q0 cmq0 7280
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-mi 7296  df-mpq 7335  df-enq 7337  df-nqqs 7338  df-mqqs 7340  df-enq0 7414  df-nq0 7415  df-mq0 7418
This theorem is referenced by:  prarloclemlo  7484  prarloclemcalc  7492
  Copyright terms: Public domain W3C validator