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

Theorem suplocexprlemrl 8074
Description: Lemma for suplocexpr 8082. The lower cut of the putative supremum is rounded. (Contributed by Jim Kingdon, 9-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m (𝜑 → ∃𝑥 𝑥𝐴)
suplocexpr.ub (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
suplocexpr.loc (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
Assertion
Ref Expression
suplocexprlemrl (𝜑 → ∀𝑞Q (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
Distinct variable groups:   𝐴,𝑟   𝑥,𝐴,𝑦   𝜑,𝑞,𝑟   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧,𝑞)

Proof of Theorem suplocexprlemrl
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 suplocexprlemell 8070 . . . . . . 7 (𝑞 (1st𝐴) ↔ ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
21biimpi 120 . . . . . 6 (𝑞 (1st𝐴) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
32adantl 277 . . . . 5 (((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
4 suplocexpr.m . . . . . . . . . . 11 (𝜑 → ∃𝑥 𝑥𝐴)
5 suplocexpr.ub . . . . . . . . . . 11 (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
6 suplocexpr.loc . . . . . . . . . . 11 (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
74, 5, 6suplocexprlemss 8072 . . . . . . . . . 10 (𝜑𝐴P)
87ad3antrrr 496 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝐴P)
9 simprl 535 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠𝐴)
108, 9sseldd 3249 . . . . . . . 8 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠P)
11 prop 7832 . . . . . . . 8 (𝑠P → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
1210, 11syl 14 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
13 simprr 537 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑞 ∈ (1st𝑠))
14 prnmaxl 7845 . . . . . . 7 ((⟨(1st𝑠), (2nd𝑠)⟩ ∈ P𝑞 ∈ (1st𝑠)) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
1512, 13, 14syl2anc 415 . . . . . 6 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
16 ltrelnq 7722 . . . . . . . . 9 <Q ⊆ (Q × Q)
1716brel 4822 . . . . . . . 8 (𝑞 <Q 𝑟 → (𝑞Q𝑟Q))
1817simprd 114 . . . . . . 7 (𝑞 <Q 𝑟𝑟Q)
1918ad2antll 495 . . . . . 6 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟Q)
20 simprr 537 . . . . . . 7 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑞 <Q 𝑟)
21 simplrl 541 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑠𝐴)
22 simprl 535 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ (1st𝑠))
23 rspe 2599 . . . . . . . . 9 ((𝑠𝐴𝑟 ∈ (1st𝑠)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
2421, 22, 23syl2anc 415 . . . . . . . 8 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
25 suplocexprlemell 8070 . . . . . . . 8 (𝑟 (1st𝐴) ↔ ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
2624, 25sylibr 134 . . . . . . 7 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 (1st𝐴))
2720, 26jca 306 . . . . . 6 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → (𝑞 <Q 𝑟𝑟 (1st𝐴)))
2815, 19, 27reximssdv 2654 . . . . 5 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
293, 28rexlimddv 2673 . . . 4 (((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
3029ex 115 . . 3 ((𝜑𝑞Q) → (𝑞 (1st𝐴) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
31 simprr 537 . . . . . . 7 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑟 (1st𝐴))
3231, 25sylib 122 . . . . . 6 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
33 simprl 535 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠𝐴)
34 simplrl 541 . . . . . . . . . 10 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 <Q 𝑟)
357ad3antrrr 496 . . . . . . . . . . . . 13 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝐴P)
3635, 33sseldd 3249 . . . . . . . . . . . 12 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠P)
3736, 11syl 14 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
38 simprr 537 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑟 ∈ (1st𝑠))
39 prcdnql 7841 . . . . . . . . . . 11 ((⟨(1st𝑠), (2nd𝑠)⟩ ∈ P𝑟 ∈ (1st𝑠)) → (𝑞 <Q 𝑟𝑞 ∈ (1st𝑠)))
4037, 38, 39syl2anc 415 . . . . . . . . . 10 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → (𝑞 <Q 𝑟𝑞 ∈ (1st𝑠)))
4134, 40mpd 13 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 ∈ (1st𝑠))
42 19.8a 1643 . . . . . . . . 9 ((𝑠𝐴𝑞 ∈ (1st𝑠)) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4333, 41, 42syl2anc 415 . . . . . . . 8 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
44 df-rex 2534 . . . . . . . 8 (∃𝑠𝐴 𝑞 ∈ (1st𝑠) ↔ ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4543, 44sylibr 134 . . . . . . 7 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
4645, 1sylibr 134 . . . . . 6 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 (1st𝐴))
4732, 46rexlimddv 2673 . . . . 5 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑞 (1st𝐴))
4847ex 115 . . . 4 ((𝜑𝑞Q) → ((𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
4948rexlimdvw 2672 . . 3 ((𝜑𝑞Q) → (∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
5030, 49impbid 129 . 2 ((𝜑𝑞Q) → (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
5150ralrimiva 2623 1 (𝜑 → ∀𝑞Q (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 720  wex 1545  wcel 2209  wral 2528  wrex 2529  wss 3220  cop 3708   cuni 3930   class class class wbr 4125  cima 4772  cfv 5372  1st c1st 6362  2nd c2nd 6363  Qcnq 7637   <Q cltq 7642  Pcnp 7648  <P cltp 7652
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-2nd 6365  df-qs 6803  df-ni 7661  df-nqqs 7705  df-ltnqqs 7710  df-inp 7823  df-iltp 7827
This theorem is referenced by:  suplocexprlemex  8079
  Copyright terms: Public domain W3C validator