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

Theorem recexprlemss1u 6691
Description: The upper cut of 𝐴 ·P 𝐵 is a subset of the upper cut of one. Lemma for recexpr 6693. (Contributed by Jim Kingdon, 27-Dec-2019.)
Hypothesis
Ref Expression
recexpr.1 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q𝑦) ∈ (1st𝐴))}⟩
Assertion
Ref Expression
recexprlemss1u (𝐴P → (2nd ‘(𝐴 ·P 𝐵)) ⊆ (2nd ‘1P))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem recexprlemss1u
Dummy variables 𝑞 𝑧 𝑤 𝑢 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 recexpr.1 . . . . . 6 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q𝑦) ∈ (1st𝐴))}⟩
21recexprlempr 6687 . . . . 5 (𝐴P𝐵P)
3 df-imp 6524 . . . . . 6 ·P = (𝑦P, 𝑤P ↦ ⟨{𝑢Q ∣ ∃𝑓Q𝑔Q (𝑓 ∈ (1st𝑦) ∧ 𝑔 ∈ (1st𝑤) ∧ 𝑢 = (𝑓 ·Q 𝑔))}, {𝑢Q ∣ ∃𝑓Q𝑔Q (𝑓 ∈ (2nd𝑦) ∧ 𝑔 ∈ (2nd𝑤) ∧ 𝑢 = (𝑓 ·Q 𝑔))}⟩)
4 mulclnq 6431 . . . . . 6 ((𝑓Q𝑔Q) → (𝑓 ·Q 𝑔) ∈ Q)
53, 4genpelvu 6568 . . . . 5 ((𝐴P𝐵P) → (𝑤 ∈ (2nd ‘(𝐴 ·P 𝐵)) ↔ ∃𝑧 ∈ (2nd𝐴)∃𝑞 ∈ (2nd𝐵)𝑤 = (𝑧 ·Q 𝑞)))
62, 5mpdan 398 . . . 4 (𝐴P → (𝑤 ∈ (2nd ‘(𝐴 ·P 𝐵)) ↔ ∃𝑧 ∈ (2nd𝐴)∃𝑞 ∈ (2nd𝐵)𝑤 = (𝑧 ·Q 𝑞)))
71recexprlemelu 6678 . . . . . . . 8 (𝑞 ∈ (2nd𝐵) ↔ ∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)))
8 ltrelnq 6420 . . . . . . . . . . . . . 14 <Q ⊆ (Q × Q)
98brel 4355 . . . . . . . . . . . . 13 (𝑦 <Q 𝑞 → (𝑦Q𝑞Q))
109simpld 105 . . . . . . . . . . . 12 (𝑦 <Q 𝑞𝑦Q)
11 prop 6530 . . . . . . . . . . . . . . . . . 18 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
12 elprnqu 6537 . . . . . . . . . . . . . . . . . 18 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑧 ∈ (2nd𝐴)) → 𝑧Q)
1311, 12sylan 267 . . . . . . . . . . . . . . . . 17 ((𝐴P𝑧 ∈ (2nd𝐴)) → 𝑧Q)
14 ltmnqi 6458 . . . . . . . . . . . . . . . . . 18 ((𝑦 <Q 𝑞𝑧Q) → (𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞))
1514expcom 109 . . . . . . . . . . . . . . . . 17 (𝑧Q → (𝑦 <Q 𝑞 → (𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞)))
1613, 15syl 14 . . . . . . . . . . . . . . . 16 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑦 <Q 𝑞 → (𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞)))
1716adantr 261 . . . . . . . . . . . . . . 15 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → (𝑦 <Q 𝑞 → (𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞)))
18 prltlu 6542 . . . . . . . . . . . . . . . . . . . 20 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P ∧ (*Q𝑦) ∈ (1st𝐴) ∧ 𝑧 ∈ (2nd𝐴)) → (*Q𝑦) <Q 𝑧)
1911, 18syl3an1 1168 . . . . . . . . . . . . . . . . . . 19 ((𝐴P ∧ (*Q𝑦) ∈ (1st𝐴) ∧ 𝑧 ∈ (2nd𝐴)) → (*Q𝑦) <Q 𝑧)
20193com23 1110 . . . . . . . . . . . . . . . . . 18 ((𝐴P𝑧 ∈ (2nd𝐴) ∧ (*Q𝑦) ∈ (1st𝐴)) → (*Q𝑦) <Q 𝑧)
21203expia 1106 . . . . . . . . . . . . . . . . 17 ((𝐴P𝑧 ∈ (2nd𝐴)) → ((*Q𝑦) ∈ (1st𝐴) → (*Q𝑦) <Q 𝑧))
2221adantr 261 . . . . . . . . . . . . . . . 16 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → ((*Q𝑦) ∈ (1st𝐴) → (*Q𝑦) <Q 𝑧))
23 ltmnqi 6458 . . . . . . . . . . . . . . . . . . . . 21 (((*Q𝑦) <Q 𝑧𝑦Q) → (𝑦 ·Q (*Q𝑦)) <Q (𝑦 ·Q 𝑧))
2423expcom 109 . . . . . . . . . . . . . . . . . . . 20 (𝑦Q → ((*Q𝑦) <Q 𝑧 → (𝑦 ·Q (*Q𝑦)) <Q (𝑦 ·Q 𝑧)))
2524adantr 261 . . . . . . . . . . . . . . . . . . 19 ((𝑦Q𝑧Q) → ((*Q𝑦) <Q 𝑧 → (𝑦 ·Q (*Q𝑦)) <Q (𝑦 ·Q 𝑧)))
26 recidnq 6448 . . . . . . . . . . . . . . . . . . . . 21 (𝑦Q → (𝑦 ·Q (*Q𝑦)) = 1Q)
2726adantr 261 . . . . . . . . . . . . . . . . . . . 20 ((𝑦Q𝑧Q) → (𝑦 ·Q (*Q𝑦)) = 1Q)
28 mulcomnqg 6438 . . . . . . . . . . . . . . . . . . . 20 ((𝑦Q𝑧Q) → (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦))
2927, 28breq12d 3774 . . . . . . . . . . . . . . . . . . 19 ((𝑦Q𝑧Q) → ((𝑦 ·Q (*Q𝑦)) <Q (𝑦 ·Q 𝑧) ↔ 1Q <Q (𝑧 ·Q 𝑦)))
3025, 29sylibd 138 . . . . . . . . . . . . . . . . . 18 ((𝑦Q𝑧Q) → ((*Q𝑦) <Q 𝑧 → 1Q <Q (𝑧 ·Q 𝑦)))
3130ancoms 255 . . . . . . . . . . . . . . . . 17 ((𝑧Q𝑦Q) → ((*Q𝑦) <Q 𝑧 → 1Q <Q (𝑧 ·Q 𝑦)))
3213, 31sylan 267 . . . . . . . . . . . . . . . 16 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → ((*Q𝑦) <Q 𝑧 → 1Q <Q (𝑧 ·Q 𝑦)))
3322, 32syld 40 . . . . . . . . . . . . . . 15 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → ((*Q𝑦) ∈ (1st𝐴) → 1Q <Q (𝑧 ·Q 𝑦)))
3417, 33anim12d 318 . . . . . . . . . . . . . 14 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → ((𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) → ((𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞) ∧ 1Q <Q (𝑧 ·Q 𝑦))))
35 ltsonq 6453 . . . . . . . . . . . . . . . 16 <Q Or Q
3635, 8sotri 4683 . . . . . . . . . . . . . . 15 ((1Q <Q (𝑧 ·Q 𝑦) ∧ (𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞)) → 1Q <Q (𝑧 ·Q 𝑞))
3736ancoms 255 . . . . . . . . . . . . . 14 (((𝑧 ·Q 𝑦) <Q (𝑧 ·Q 𝑞) ∧ 1Q <Q (𝑧 ·Q 𝑦)) → 1Q <Q (𝑧 ·Q 𝑞))
3834, 37syl6 29 . . . . . . . . . . . . 13 (((𝐴P𝑧 ∈ (2nd𝐴)) ∧ 𝑦Q) → ((𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) → 1Q <Q (𝑧 ·Q 𝑞)))
3938exp4b 349 . . . . . . . . . . . 12 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑦Q → (𝑦 <Q 𝑞 → ((*Q𝑦) ∈ (1st𝐴) → 1Q <Q (𝑧 ·Q 𝑞)))))
4010, 39syl5 28 . . . . . . . . . . 11 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑦 <Q 𝑞 → (𝑦 <Q 𝑞 → ((*Q𝑦) ∈ (1st𝐴) → 1Q <Q (𝑧 ·Q 𝑞)))))
4140pm2.43d 44 . . . . . . . . . 10 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑦 <Q 𝑞 → ((*Q𝑦) ∈ (1st𝐴) → 1Q <Q (𝑧 ·Q 𝑞))))
4241impd 242 . . . . . . . . 9 ((𝐴P𝑧 ∈ (2nd𝐴)) → ((𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) → 1Q <Q (𝑧 ·Q 𝑞)))
4342exlimdv 1700 . . . . . . . 8 ((𝐴P𝑧 ∈ (2nd𝐴)) → (∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) → 1Q <Q (𝑧 ·Q 𝑞)))
447, 43syl5bi 141 . . . . . . 7 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑞 ∈ (2nd𝐵) → 1Q <Q (𝑧 ·Q 𝑞)))
45 breq2 3765 . . . . . . . 8 (𝑤 = (𝑧 ·Q 𝑞) → (1Q <Q 𝑤 ↔ 1Q <Q (𝑧 ·Q 𝑞)))
4645biimprcd 149 . . . . . . 7 (1Q <Q (𝑧 ·Q 𝑞) → (𝑤 = (𝑧 ·Q 𝑞) → 1Q <Q 𝑤))
4744, 46syl6 29 . . . . . 6 ((𝐴P𝑧 ∈ (2nd𝐴)) → (𝑞 ∈ (2nd𝐵) → (𝑤 = (𝑧 ·Q 𝑞) → 1Q <Q 𝑤)))
4847expimpd 345 . . . . 5 (𝐴P → ((𝑧 ∈ (2nd𝐴) ∧ 𝑞 ∈ (2nd𝐵)) → (𝑤 = (𝑧 ·Q 𝑞) → 1Q <Q 𝑤)))
4948rexlimdvv 2436 . . . 4 (𝐴P → (∃𝑧 ∈ (2nd𝐴)∃𝑞 ∈ (2nd𝐵)𝑤 = (𝑧 ·Q 𝑞) → 1Q <Q 𝑤))
506, 49sylbid 139 . . 3 (𝐴P → (𝑤 ∈ (2nd ‘(𝐴 ·P 𝐵)) → 1Q <Q 𝑤))
51 1pru 6611 . . . 4 (2nd ‘1P) = {𝑤 ∣ 1Q <Q 𝑤}
5251abeq2i 2148 . . 3 (𝑤 ∈ (2nd ‘1P) ↔ 1Q <Q 𝑤)
5350, 52syl6ibr 151 . 2 (𝐴P → (𝑤 ∈ (2nd ‘(𝐴 ·P 𝐵)) → 𝑤 ∈ (2nd ‘1P)))
5453ssrdv 2948 1 (𝐴P → (2nd ‘(𝐴 ·P 𝐵)) ⊆ (2nd ‘1P))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wb 98   = wceq 1243  wex 1381  wcel 1393  {cab 2026  wrex 2304  wss 2914  cop 3375   class class class wbr 3761  cfv 4865  (class class class)co 5475  1st c1st 5728  2nd c2nd 5729  Qcnq 6335  1Qc1q 6336   ·Q cmq 6338  *Qcrq 6339   <Q cltq 6340  Pcnp 6346  1Pc1p 6347   ·P cmp 6349
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 3869  ax-sep 3872  ax-nul 3880  ax-pow 3924  ax-pr 3941  ax-un 4142  ax-setind 4232  ax-iinf 4274
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 2308  df-rex 2309  df-reu 2310  df-rab 2312  df-v 2556  df-sbc 2762  df-csb 2850  df-dif 2917  df-un 2919  df-in 2921  df-ss 2928  df-nul 3222  df-pw 3358  df-sn 3378  df-pr 3379  df-op 3381  df-uni 3578  df-int 3613  df-iun 3656  df-br 3762  df-opab 3816  df-mpt 3817  df-tr 3852  df-eprel 4023  df-id 4027  df-po 4030  df-iso 4031  df-iord 4075  df-on 4077  df-suc 4080  df-iom 4277  df-xp 4314  df-rel 4315  df-cnv 4316  df-co 4317  df-dm 4318  df-rn 4319  df-res 4320  df-ima 4321  df-iota 4830  df-fun 4867  df-fn 4868  df-f 4869  df-f1 4870  df-fo 4871  df-f1o 4872  df-fv 4873  df-ov 5478  df-oprab 5479  df-mpt2 5480  df-1st 5730  df-2nd 5731  df-recs 5883  df-irdg 5920  df-1o 5964  df-oadd 5968  df-omul 5969  df-er 6069  df-ec 6071  df-qs 6075  df-ni 6359  df-pli 6360  df-mi 6361  df-lti 6362  df-plpq 6399  df-mpq 6400  df-enq 6402  df-nqqs 6403  df-plqqs 6404  df-mqqs 6405  df-1nqqs 6406  df-rq 6407  df-ltnqqs 6408  df-inp 6521  df-i1p 6522  df-imp 6524
This theorem is referenced by:  recexprlemex  6692
  Copyright terms: Public domain W3C validator