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

Theorem suplocexpr 7792
Description: An inhabited, bounded-above, located set of positive reals has a supremum. (Contributed by Jim Kingdon, 7-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m (𝜑 → ∃𝑥 𝑥𝐴)
suplocexpr.ub (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
suplocexpr.loc (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
Assertion
Ref Expression
suplocexpr (𝜑 → ∃𝑥P (∀𝑦𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦P (𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧)))
Distinct variable groups:   𝑦,𝐴,𝑧,𝑥   𝜑,𝑦,𝑧,𝑥

Proof of Theorem suplocexpr
Dummy variables 𝑎 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suplocexpr.m . . 3 (𝜑 → ∃𝑥 𝑥𝐴)
2 suplocexpr.ub . . 3 (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
3 suplocexpr.loc . . 3 (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
4 breq1 4036 . . . . . 6 (𝑎 = 𝑤 → (𝑎 <Q 𝑢𝑤 <Q 𝑢))
54cbvrexv 2730 . . . . 5 (∃𝑎 (2nd𝐴)𝑎 <Q 𝑢 ↔ ∃𝑤 (2nd𝐴)𝑤 <Q 𝑢)
65rabbii 2749 . . . 4 {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢} = {𝑢Q ∣ ∃𝑤 (2nd𝐴)𝑤 <Q 𝑢}
76opeq2i 3812 . . 3 (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑤 (2nd𝐴)𝑤 <Q 𝑢}⟩
81, 2, 3, 7suplocexprlemex 7789 . 2 (𝜑 → ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ ∈ P)
91, 2, 3, 7suplocexprlemub 7790 . 2 (𝜑 → ∀𝑦𝐴 ¬ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦)
101, 2, 3, 7suplocexprlemlub 7791 . . 3 (𝜑 → (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧))
1110ralrimivw 2571 . 2 (𝜑 → ∀𝑦P (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧))
12 breq1 4036 . . . . . 6 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → (𝑥<P 𝑦 ↔ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
1312notbid 668 . . . . 5 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → (¬ 𝑥<P 𝑦 ↔ ¬ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
1413ralbidv 2497 . . . 4 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → (∀𝑦𝐴 ¬ 𝑥<P 𝑦 ↔ ∀𝑦𝐴 ¬ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
15 breq2 4037 . . . . . 6 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → (𝑦<P 𝑥𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩))
1615imbi1d 231 . . . . 5 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ((𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧) ↔ (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧)))
1716ralbidv 2497 . . . 4 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → (∀𝑦P (𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧) ↔ ∀𝑦P (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧)))
1814, 17anbi12d 473 . . 3 (𝑥 = ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ((∀𝑦𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦P (𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧)) ↔ (∀𝑦𝐴 ¬ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦 ∧ ∀𝑦P (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧))))
1918rspcev 2868 . 2 ((⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ ∈ P ∧ (∀𝑦𝐴 ¬ ⟨ (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩<P 𝑦 ∧ ∀𝑦P (𝑦<P (1st𝐴), {𝑢Q ∣ ∃𝑎 (2nd𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧𝐴 𝑦<P 𝑧))) → ∃𝑥P (∀𝑦𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦P (𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧)))
208, 9, 11, 19syl12anc 1247 1 (𝜑 → ∃𝑥P (∀𝑦𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦P (𝑦<P 𝑥 → ∃𝑧𝐴 𝑦<P 𝑧)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 709   = wceq 1364  wex 1506  wcel 2167  wral 2475  wrex 2476  {crab 2479  cop 3625   cuni 3839   cint 3874   class class class wbr 4033  cima 4666  1st c1st 6196  2nd c2nd 6197  Qcnq 7347   <Q cltq 7352  Pcnp 7358  <P cltp 7362
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-eprel 4324  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-irdg 6428  df-1o 6474  df-2o 6475  df-oadd 6478  df-omul 6479  df-er 6592  df-ec 6594  df-qs 6598  df-ni 7371  df-pli 7372  df-mi 7373  df-lti 7374  df-plpq 7411  df-mpq 7412  df-enq 7414  df-nqqs 7415  df-plqqs 7416  df-mqqs 7417  df-1nqqs 7418  df-rq 7419  df-ltnqqs 7420  df-enq0 7491  df-nq0 7492  df-0nq0 7493  df-plq0 7494  df-mq0 7495  df-inp 7533  df-iltp 7537
This theorem is referenced by:  suplocsrlempr  7874
  Copyright terms: Public domain W3C validator