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

Theorem mullocprlem 6725
Description: Calculations for mullocpr 6726. (Contributed by Jim Kingdon, 10-Dec-2019.)
Hypotheses
Ref Expression
mullocprlem.ab (𝜑 → (𝐴P𝐵P))
mullocprlem.uqedu (𝜑 → (𝑈 ·Q 𝑄) <Q (𝐸 ·Q (𝐷 ·Q 𝑈)))
mullocprlem.edutdu (𝜑 → (𝐸 ·Q (𝐷 ·Q 𝑈)) <Q (𝑇 ·Q (𝐷 ·Q 𝑈)))
mullocprlem.tdudr (𝜑 → (𝑇 ·Q (𝐷 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅))
mullocprlem.qr (𝜑 → (𝑄Q𝑅Q))
mullocprlem.duq (𝜑 → (𝐷Q𝑈Q))
mullocprlem.du (𝜑 → (𝐷 ∈ (1st𝐴) ∧ 𝑈 ∈ (2nd𝐴)))
mullocprlem.et (𝜑 → (𝐸Q𝑇Q))
Assertion
Ref Expression
mullocprlem (𝜑 → (𝑄 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))

Proof of Theorem mullocprlem
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mullocprlem.uqedu . . . . . . 7 (𝜑 → (𝑈 ·Q 𝑄) <Q (𝐸 ·Q (𝐷 ·Q 𝑈)))
2 mullocprlem.et . . . . . . . . 9 (𝜑 → (𝐸Q𝑇Q))
32simpld 109 . . . . . . . 8 (𝜑𝐸Q)
4 mullocprlem.duq . . . . . . . . 9 (𝜑 → (𝐷Q𝑈Q))
54simpld 109 . . . . . . . 8 (𝜑𝐷Q)
64simprd 111 . . . . . . . 8 (𝜑𝑈Q)
7 mulcomnqg 6538 . . . . . . . . 9 ((𝑥Q𝑦Q) → (𝑥 ·Q 𝑦) = (𝑦 ·Q 𝑥))
87adantl 266 . . . . . . . 8 ((𝜑 ∧ (𝑥Q𝑦Q)) → (𝑥 ·Q 𝑦) = (𝑦 ·Q 𝑥))
9 mulassnqg 6539 . . . . . . . . 9 ((𝑥Q𝑦Q𝑧Q) → ((𝑥 ·Q 𝑦) ·Q 𝑧) = (𝑥 ·Q (𝑦 ·Q 𝑧)))
109adantl 266 . . . . . . . 8 ((𝜑 ∧ (𝑥Q𝑦Q𝑧Q)) → ((𝑥 ·Q 𝑦) ·Q 𝑧) = (𝑥 ·Q (𝑦 ·Q 𝑧)))
113, 5, 6, 8, 10caov13d 5711 . . . . . . 7 (𝜑 → (𝐸 ·Q (𝐷 ·Q 𝑈)) = (𝑈 ·Q (𝐷 ·Q 𝐸)))
121, 11breqtrd 3815 . . . . . 6 (𝜑 → (𝑈 ·Q 𝑄) <Q (𝑈 ·Q (𝐷 ·Q 𝐸)))
13 mullocprlem.qr . . . . . . . 8 (𝜑 → (𝑄Q𝑅Q))
1413simpld 109 . . . . . . 7 (𝜑𝑄Q)
15 mulclnq 6531 . . . . . . . 8 ((𝐷Q𝐸Q) → (𝐷 ·Q 𝐸) ∈ Q)
165, 3, 15syl2anc 397 . . . . . . 7 (𝜑 → (𝐷 ·Q 𝐸) ∈ Q)
17 ltmnqg 6556 . . . . . . 7 ((𝑄Q ∧ (𝐷 ·Q 𝐸) ∈ Q𝑈Q) → (𝑄 <Q (𝐷 ·Q 𝐸) ↔ (𝑈 ·Q 𝑄) <Q (𝑈 ·Q (𝐷 ·Q 𝐸))))
1814, 16, 6, 17syl3anc 1146 . . . . . 6 (𝜑 → (𝑄 <Q (𝐷 ·Q 𝐸) ↔ (𝑈 ·Q 𝑄) <Q (𝑈 ·Q (𝐷 ·Q 𝐸))))
1912, 18mpbird 160 . . . . 5 (𝜑𝑄 <Q (𝐷 ·Q 𝐸))
2019adantr 265 . . . 4 ((𝜑𝐸 ∈ (1st𝐵)) → 𝑄 <Q (𝐷 ·Q 𝐸))
21 mullocprlem.ab . . . . . . . 8 (𝜑 → (𝐴P𝐵P))
2221simpld 109 . . . . . . 7 (𝜑𝐴P)
23 mullocprlem.du . . . . . . . 8 (𝜑 → (𝐷 ∈ (1st𝐴) ∧ 𝑈 ∈ (2nd𝐴)))
2423simpld 109 . . . . . . 7 (𝜑𝐷 ∈ (1st𝐴))
2522, 24jca 294 . . . . . 6 (𝜑 → (𝐴P𝐷 ∈ (1st𝐴)))
2625adantr 265 . . . . 5 ((𝜑𝐸 ∈ (1st𝐵)) → (𝐴P𝐷 ∈ (1st𝐴)))
2721simprd 111 . . . . . 6 (𝜑𝐵P)
2827anim1i 327 . . . . 5 ((𝜑𝐸 ∈ (1st𝐵)) → (𝐵P𝐸 ∈ (1st𝐵)))
2914adantr 265 . . . . 5 ((𝜑𝐸 ∈ (1st𝐵)) → 𝑄Q)
30 mulnqprl 6723 . . . . 5 ((((𝐴P𝐷 ∈ (1st𝐴)) ∧ (𝐵P𝐸 ∈ (1st𝐵))) ∧ 𝑄Q) → (𝑄 <Q (𝐷 ·Q 𝐸) → 𝑄 ∈ (1st ‘(𝐴 ·P 𝐵))))
3126, 28, 29, 30syl21anc 1145 . . . 4 ((𝜑𝐸 ∈ (1st𝐵)) → (𝑄 <Q (𝐷 ·Q 𝐸) → 𝑄 ∈ (1st ‘(𝐴 ·P 𝐵))))
3220, 31mpd 13 . . 3 ((𝜑𝐸 ∈ (1st𝐵)) → 𝑄 ∈ (1st ‘(𝐴 ·P 𝐵)))
3332orcd 662 . 2 ((𝜑𝐸 ∈ (1st𝐵)) → (𝑄 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))
342simprd 111 . . . . . . 7 (𝜑𝑇Q)
35 mulcomnqg 6538 . . . . . . 7 ((𝑇Q𝑈Q) → (𝑇 ·Q 𝑈) = (𝑈 ·Q 𝑇))
3634, 6, 35syl2anc 397 . . . . . 6 (𝜑 → (𝑇 ·Q 𝑈) = (𝑈 ·Q 𝑇))
37 mullocprlem.tdudr . . . . . . 7 (𝜑 → (𝑇 ·Q (𝐷 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅))
38 mulclnq 6531 . . . . . . . . . 10 ((𝑇Q𝑈Q) → (𝑇 ·Q 𝑈) ∈ Q)
3934, 6, 38syl2anc 397 . . . . . . . . 9 (𝜑 → (𝑇 ·Q 𝑈) ∈ Q)
4013simprd 111 . . . . . . . . 9 (𝜑𝑅Q)
41 ltmnqg 6556 . . . . . . . . 9 (((𝑇 ·Q 𝑈) ∈ Q𝑅Q𝐷Q) → ((𝑇 ·Q 𝑈) <Q 𝑅 ↔ (𝐷 ·Q (𝑇 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅)))
4239, 40, 5, 41syl3anc 1146 . . . . . . . 8 (𝜑 → ((𝑇 ·Q 𝑈) <Q 𝑅 ↔ (𝐷 ·Q (𝑇 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅)))
4334, 5, 6, 8, 10caov12d 5709 . . . . . . . . 9 (𝜑 → (𝑇 ·Q (𝐷 ·Q 𝑈)) = (𝐷 ·Q (𝑇 ·Q 𝑈)))
4443breq1d 3801 . . . . . . . 8 (𝜑 → ((𝑇 ·Q (𝐷 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅) ↔ (𝐷 ·Q (𝑇 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅)))
4542, 44bitr4d 184 . . . . . . 7 (𝜑 → ((𝑇 ·Q 𝑈) <Q 𝑅 ↔ (𝑇 ·Q (𝐷 ·Q 𝑈)) <Q (𝐷 ·Q 𝑅)))
4637, 45mpbird 160 . . . . . 6 (𝜑 → (𝑇 ·Q 𝑈) <Q 𝑅)
4736, 46eqbrtrrd 3813 . . . . 5 (𝜑 → (𝑈 ·Q 𝑇) <Q 𝑅)
4847adantr 265 . . . 4 ((𝜑𝑇 ∈ (2nd𝐵)) → (𝑈 ·Q 𝑇) <Q 𝑅)
4923simprd 111 . . . . . . 7 (𝜑𝑈 ∈ (2nd𝐴))
5022, 49jca 294 . . . . . 6 (𝜑 → (𝐴P𝑈 ∈ (2nd𝐴)))
5150adantr 265 . . . . 5 ((𝜑𝑇 ∈ (2nd𝐵)) → (𝐴P𝑈 ∈ (2nd𝐴)))
5227anim1i 327 . . . . 5 ((𝜑𝑇 ∈ (2nd𝐵)) → (𝐵P𝑇 ∈ (2nd𝐵)))
5340adantr 265 . . . . 5 ((𝜑𝑇 ∈ (2nd𝐵)) → 𝑅Q)
54 mulnqpru 6724 . . . . 5 ((((𝐴P𝑈 ∈ (2nd𝐴)) ∧ (𝐵P𝑇 ∈ (2nd𝐵))) ∧ 𝑅Q) → ((𝑈 ·Q 𝑇) <Q 𝑅𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))
5551, 52, 53, 54syl21anc 1145 . . . 4 ((𝜑𝑇 ∈ (2nd𝐵)) → ((𝑈 ·Q 𝑇) <Q 𝑅𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))
5648, 55mpd 13 . . 3 ((𝜑𝑇 ∈ (2nd𝐵)) → 𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵)))
5756olcd 663 . 2 ((𝜑𝑇 ∈ (2nd𝐵)) → (𝑄 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))
58 mullocprlem.edutdu . . . 4 (𝜑 → (𝐸 ·Q (𝐷 ·Q 𝑈)) <Q (𝑇 ·Q (𝐷 ·Q 𝑈)))
59 mulclnq 6531 . . . . . . 7 ((𝐷Q𝑈Q) → (𝐷 ·Q 𝑈) ∈ Q)
604, 59syl 14 . . . . . 6 (𝜑 → (𝐷 ·Q 𝑈) ∈ Q)
61 ltmnqg 6556 . . . . . 6 ((𝐸Q𝑇Q ∧ (𝐷 ·Q 𝑈) ∈ Q) → (𝐸 <Q 𝑇 ↔ ((𝐷 ·Q 𝑈) ·Q 𝐸) <Q ((𝐷 ·Q 𝑈) ·Q 𝑇)))
623, 34, 60, 61syl3anc 1146 . . . . 5 (𝜑 → (𝐸 <Q 𝑇 ↔ ((𝐷 ·Q 𝑈) ·Q 𝐸) <Q ((𝐷 ·Q 𝑈) ·Q 𝑇)))
63 mulcomnqg 6538 . . . . . . 7 (((𝐷 ·Q 𝑈) ∈ Q𝐸Q) → ((𝐷 ·Q 𝑈) ·Q 𝐸) = (𝐸 ·Q (𝐷 ·Q 𝑈)))
6460, 3, 63syl2anc 397 . . . . . 6 (𝜑 → ((𝐷 ·Q 𝑈) ·Q 𝐸) = (𝐸 ·Q (𝐷 ·Q 𝑈)))
65 mulcomnqg 6538 . . . . . . 7 (((𝐷 ·Q 𝑈) ∈ Q𝑇Q) → ((𝐷 ·Q 𝑈) ·Q 𝑇) = (𝑇 ·Q (𝐷 ·Q 𝑈)))
6660, 34, 65syl2anc 397 . . . . . 6 (𝜑 → ((𝐷 ·Q 𝑈) ·Q 𝑇) = (𝑇 ·Q (𝐷 ·Q 𝑈)))
6764, 66breq12d 3804 . . . . 5 (𝜑 → (((𝐷 ·Q 𝑈) ·Q 𝐸) <Q ((𝐷 ·Q 𝑈) ·Q 𝑇) ↔ (𝐸 ·Q (𝐷 ·Q 𝑈)) <Q (𝑇 ·Q (𝐷 ·Q 𝑈))))
6862, 67bitrd 181 . . . 4 (𝜑 → (𝐸 <Q 𝑇 ↔ (𝐸 ·Q (𝐷 ·Q 𝑈)) <Q (𝑇 ·Q (𝐷 ·Q 𝑈))))
6958, 68mpbird 160 . . 3 (𝜑𝐸 <Q 𝑇)
70 prop 6630 . . . 4 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
71 prloc 6646 . . . 4 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝐸 <Q 𝑇) → (𝐸 ∈ (1st𝐵) ∨ 𝑇 ∈ (2nd𝐵)))
7270, 71sylan 271 . . 3 ((𝐵P𝐸 <Q 𝑇) → (𝐸 ∈ (1st𝐵) ∨ 𝑇 ∈ (2nd𝐵)))
7327, 69, 72syl2anc 397 . 2 (𝜑 → (𝐸 ∈ (1st𝐵) ∨ 𝑇 ∈ (2nd𝐵)))
7433, 57, 73mpjaodan 722 1 (𝜑 → (𝑄 ∈ (1st ‘(𝐴 ·P 𝐵)) ∨ 𝑅 ∈ (2nd ‘(𝐴 ·P 𝐵))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wo 639  w3a 896   = wceq 1259  wcel 1409  cop 3405   class class class wbr 3791  cfv 4929  (class class class)co 5539  1st c1st 5792  2nd c2nd 5793  Qcnq 6435   ·Q cmq 6438   <Q cltq 6440  Pcnp 6446   ·P cmp 6449
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-eprel 4053  df-id 4057  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-1st 5794  df-2nd 5795  df-recs 5950  df-irdg 5987  df-1o 6031  df-oadd 6035  df-omul 6036  df-er 6136  df-ec 6138  df-qs 6142  df-ni 6459  df-mi 6461  df-lti 6462  df-mpq 6500  df-enq 6502  df-nqqs 6503  df-mqqs 6505  df-1nqqs 6506  df-rq 6507  df-ltnqqs 6508  df-inp 6621  df-imp 6624
This theorem is referenced by:  mullocpr  6726
  Copyright terms: Public domain W3C validator