Theorem suplocexpr 8092

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.

Step	Hyp	Ref	Expression
1		suplocexpr.m	. . 3 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
2		suplocexpr.ub	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
3		suplocexpr.loc	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
4		breq1 4133	. . . . . 6 ⊢ (𝑎 = 𝑤 → (𝑎 <Q 𝑢 ↔ 𝑤 <Q 𝑢))
5	4	cbvrexv 2787	. . . . 5 ⊢ (∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢 ↔ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢)
6	5	rabbii 2808	. . . 4 ⊢ {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}
7	6	opeq2i 3908	. . 3 ⊢ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩
8	1, 2, 3, 7	suplocexprlemex 8089	. 2 ⊢ (𝜑 → ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ ∈ P)
9	1, 2, 3, 7	suplocexprlemub 8090	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦)
10	1, 2, 3, 7	suplocexprlemlub 8091	. . 3 ⊢ (𝜑 → (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧))
11	10	ralrimivw 2624	. 2 ⊢ (𝜑 → ∀𝑦 ∈ P (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧))
12		breq1 4133	. . . . . 6 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → (𝑥<P 𝑦 ↔ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
13	12	notbid 677	. . . . 5 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → (¬ 𝑥<P 𝑦 ↔ ¬ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
14	13	ralbidv 2550	. . . 4 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → (∀𝑦 ∈ 𝐴 ¬ 𝑥<P 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦))
15		breq2 4134	. . . . . 6 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → (𝑦<P 𝑥 ↔ 𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩))
16	15	imbi1d 231	. . . . 5 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ((𝑦<P 𝑥 → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧) ↔ (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧)))
17	16	ralbidv 2550	. . . 4 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → (∀𝑦 ∈ P (𝑦<P 𝑥 → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧) ↔ ∀𝑦 ∈ P (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧)))
18	14, 17	anbi12d 477	. . 3 ⊢ (𝑥 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ((∀𝑦 ∈ 𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦 ∈ P (𝑦<P 𝑥 → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦 ∧ ∀𝑦 ∈ P (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧))))
19	18	rspcev 2929	. 2 ⊢ ((⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ ∈ P ∧ (∀𝑦 ∈ 𝐴 ¬ ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩<P 𝑦 ∧ ∀𝑦 ∈ P (𝑦<P ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑎 ∈ ∩ (2nd “ 𝐴)𝑎 <Q 𝑢}⟩ → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧))) → ∃𝑥 ∈ P (∀𝑦 ∈ 𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦 ∈ P (𝑦<P 𝑥 → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧)))
20	8, 9, 11, 19	syl12anc 1276	1 ⊢ (𝜑 → ∃𝑥 ∈ P (∀𝑦 ∈ 𝐴 ¬ 𝑥<P 𝑦 ∧ ∀𝑦 ∈ P (𝑦<P 𝑥 → ∃𝑧 ∈ 𝐴 𝑦<P 𝑧)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532  ⟨cop 3712  ∪ cuni 3935  ∩ cint 3970   class class class wbr 4130   “ cima 4777  1^st c1st 6372  2^nd c2nd 6373  Qcnq 7647   <_Q cltq 7652  Pcnp 7658  <_P cltp 7662

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  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-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-iltp 7837

This theorem is used by:  suplocsrlempr  8174