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

Theorem mulnqprlemfl 6671
Description: Lemma for mulnqpr 6673. The forward subset relationship for the lower cut. (Contributed by Jim Kingdon, 18-Jul-2021.)
Assertion
Ref Expression
mulnqprlemfl ((𝐴Q𝐵Q) → (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) ⊆ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)))
Distinct variable groups:   𝐴,𝑙,𝑢   𝐵,𝑙,𝑢

Proof of Theorem mulnqprlemfl
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 mulnqprlemru 6670 . . . . . 6 ((𝐴Q𝐵Q) → (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ⊆ (2nd ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩))
2 ltsonq 6494 . . . . . . . . 9 <Q Or Q
3 mulclnq 6472 . . . . . . . . 9 ((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) ∈ Q)
4 sonr 4054 . . . . . . . . 9 (( <Q Or Q ∧ (𝐴 ·Q 𝐵) ∈ Q) → ¬ (𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵))
52, 3, 4sylancr 393 . . . . . . . 8 ((𝐴Q𝐵Q) → ¬ (𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵))
6 ltrelnq 6461 . . . . . . . . . . . 12 <Q ⊆ (Q × Q)
76brel 4392 . . . . . . . . . . 11 ((𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵) → ((𝐴 ·Q 𝐵) ∈ Q ∧ (𝐴 ·Q 𝐵) ∈ Q))
87simpld 105 . . . . . . . . . 10 ((𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵) → (𝐴 ·Q 𝐵) ∈ Q)
9 elex 2566 . . . . . . . . . 10 ((𝐴 ·Q 𝐵) ∈ Q → (𝐴 ·Q 𝐵) ∈ V)
108, 9syl 14 . . . . . . . . 9 ((𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵) → (𝐴 ·Q 𝐵) ∈ V)
11 breq2 3768 . . . . . . . . 9 (𝑢 = (𝐴 ·Q 𝐵) → ((𝐴 ·Q 𝐵) <Q 𝑢 ↔ (𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵)))
1210, 11elab3 2694 . . . . . . . 8 ((𝐴 ·Q 𝐵) ∈ {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢} ↔ (𝐴 ·Q 𝐵) <Q (𝐴 ·Q 𝐵))
135, 12sylnibr 602 . . . . . . 7 ((𝐴Q𝐵Q) → ¬ (𝐴 ·Q 𝐵) ∈ {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢})
14 ltnqex 6645 . . . . . . . . 9 {𝑙𝑙 <Q (𝐴 ·Q 𝐵)} ∈ V
15 gtnqex 6646 . . . . . . . . 9 {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢} ∈ V
1614, 15op2nd 5774 . . . . . . . 8 (2nd ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) = {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}
1716eleq2i 2104 . . . . . . 7 ((𝐴 ·Q 𝐵) ∈ (2nd ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) ↔ (𝐴 ·Q 𝐵) ∈ {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢})
1813, 17sylnibr 602 . . . . . 6 ((𝐴Q𝐵Q) → ¬ (𝐴 ·Q 𝐵) ∈ (2nd ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩))
191, 18ssneldd 2948 . . . . 5 ((𝐴Q𝐵Q) → ¬ (𝐴 ·Q 𝐵) ∈ (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)))
2019adantr 261 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩)) → ¬ (𝐴 ·Q 𝐵) ∈ (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)))
21 nqprlu 6643 . . . . . . 7 (𝐴Q → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P)
22 nqprlu 6643 . . . . . . 7 (𝐵Q → ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P)
23 mulclpr 6668 . . . . . . 7 ((⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩ ∈ P) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) ∈ P)
2421, 22, 23syl2an 273 . . . . . 6 ((𝐴Q𝐵Q) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) ∈ P)
25 prop 6571 . . . . . 6 ((⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)), (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))⟩ ∈ P)
2624, 25syl 14 . . . . 5 ((𝐴Q𝐵Q) → ⟨(1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)), (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))⟩ ∈ P)
27 vex 2560 . . . . . . 7 𝑟 ∈ V
28 breq1 3767 . . . . . . 7 (𝑙 = 𝑟 → (𝑙 <Q (𝐴 ·Q 𝐵) ↔ 𝑟 <Q (𝐴 ·Q 𝐵)))
2914, 15op1st 5773 . . . . . . 7 (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) = {𝑙𝑙 <Q (𝐴 ·Q 𝐵)}
3027, 28, 29elab2 2690 . . . . . 6 (𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) ↔ 𝑟 <Q (𝐴 ·Q 𝐵))
3130biimpi 113 . . . . 5 (𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) → 𝑟 <Q (𝐴 ·Q 𝐵))
32 prloc 6587 . . . . 5 ((⟨(1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)), (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))⟩ ∈ P𝑟 <Q (𝐴 ·Q 𝐵)) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ∨ (𝐴 ·Q 𝐵) ∈ (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))))
3326, 31, 32syl2an 273 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩)) → (𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)) ∨ (𝐴 ·Q 𝐵) ∈ (2nd ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))))
3420, 33ecased 1239 . . 3 (((𝐴Q𝐵Q) ∧ 𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩)) → 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)))
3534ex 108 . 2 ((𝐴Q𝐵Q) → (𝑟 ∈ (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) → 𝑟 ∈ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩))))
3635ssrdv 2951 1 ((𝐴Q𝐵Q) → (1st ‘⟨{𝑙𝑙 <Q (𝐴 ·Q 𝐵)}, {𝑢 ∣ (𝐴 ·Q 𝐵) <Q 𝑢}⟩) ⊆ (1st ‘(⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ·P ⟨{𝑙𝑙 <Q 𝐵}, {𝑢𝐵 <Q 𝑢}⟩)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97  wo 629  wcel 1393  {cab 2026  Vcvv 2557  wss 2917  cop 3378   class class class wbr 3764   Or wor 4032  cfv 4902  (class class class)co 5512  1st c1st 5765  2nd c2nd 5766  Qcnq 6376   ·Q cmq 6379   <Q cltq 6381  Pcnp 6387   ·P cmp 6390
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6400  df-pli 6401  df-mi 6402  df-lti 6403  df-plpq 6440  df-mpq 6441  df-enq 6443  df-nqqs 6444  df-plqqs 6445  df-mqqs 6446  df-1nqqs 6447  df-rq 6448  df-ltnqqs 6449  df-enq0 6520  df-nq0 6521  df-0nq0 6522  df-plq0 6523  df-mq0 6524  df-inp 6562  df-imp 6565
This theorem is referenced by:  mulnqpr  6673
  Copyright terms: Public domain W3C validator