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

Theorem lbreu 8795
 Description: If a set of reals contains a lower bound, it contains a unique lower bound. (Contributed by NM, 9-Oct-2005.)
Assertion
Ref Expression
lbreu ((𝑆 ⊆ ℝ ∧ ∃𝑥𝑆𝑦𝑆 𝑥𝑦) → ∃!𝑥𝑆𝑦𝑆 𝑥𝑦)
Distinct variable group:   𝑥,𝑦,𝑆

Proof of Theorem lbreu
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 breq2 3965 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑥𝑦𝑥𝑤))
21rspcv 2809 . . . . . . . 8 (𝑤𝑆 → (∀𝑦𝑆 𝑥𝑦𝑥𝑤))
3 breq2 3965 . . . . . . . . 9 (𝑦 = 𝑥 → (𝑤𝑦𝑤𝑥))
43rspcv 2809 . . . . . . . 8 (𝑥𝑆 → (∀𝑦𝑆 𝑤𝑦𝑤𝑥))
52, 4im2anan9r 589 . . . . . . 7 ((𝑥𝑆𝑤𝑆) → ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → (𝑥𝑤𝑤𝑥)))
6 ssel 3118 . . . . . . . . . . . 12 (𝑆 ⊆ ℝ → (𝑥𝑆𝑥 ∈ ℝ))
7 ssel 3118 . . . . . . . . . . . 12 (𝑆 ⊆ ℝ → (𝑤𝑆𝑤 ∈ ℝ))
86, 7anim12d 333 . . . . . . . . . . 11 (𝑆 ⊆ ℝ → ((𝑥𝑆𝑤𝑆) → (𝑥 ∈ ℝ ∧ 𝑤 ∈ ℝ)))
98impcom 124 . . . . . . . . . 10 (((𝑥𝑆𝑤𝑆) ∧ 𝑆 ⊆ ℝ) → (𝑥 ∈ ℝ ∧ 𝑤 ∈ ℝ))
10 letri3 7937 . . . . . . . . . 10 ((𝑥 ∈ ℝ ∧ 𝑤 ∈ ℝ) → (𝑥 = 𝑤 ↔ (𝑥𝑤𝑤𝑥)))
119, 10syl 14 . . . . . . . . 9 (((𝑥𝑆𝑤𝑆) ∧ 𝑆 ⊆ ℝ) → (𝑥 = 𝑤 ↔ (𝑥𝑤𝑤𝑥)))
1211exbiri 380 . . . . . . . 8 ((𝑥𝑆𝑤𝑆) → (𝑆 ⊆ ℝ → ((𝑥𝑤𝑤𝑥) → 𝑥 = 𝑤)))
1312com23 78 . . . . . . 7 ((𝑥𝑆𝑤𝑆) → ((𝑥𝑤𝑤𝑥) → (𝑆 ⊆ ℝ → 𝑥 = 𝑤)))
145, 13syld 45 . . . . . 6 ((𝑥𝑆𝑤𝑆) → ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → (𝑆 ⊆ ℝ → 𝑥 = 𝑤)))
1514com3r 79 . . . . 5 (𝑆 ⊆ ℝ → ((𝑥𝑆𝑤𝑆) → ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → 𝑥 = 𝑤)))
1615ralrimivv 2535 . . . 4 (𝑆 ⊆ ℝ → ∀𝑥𝑆𝑤𝑆 ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → 𝑥 = 𝑤))
1716anim2i 340 . . 3 ((∃𝑥𝑆𝑦𝑆 𝑥𝑦𝑆 ⊆ ℝ) → (∃𝑥𝑆𝑦𝑆 𝑥𝑦 ∧ ∀𝑥𝑆𝑤𝑆 ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → 𝑥 = 𝑤)))
1817ancoms 266 . 2 ((𝑆 ⊆ ℝ ∧ ∃𝑥𝑆𝑦𝑆 𝑥𝑦) → (∃𝑥𝑆𝑦𝑆 𝑥𝑦 ∧ ∀𝑥𝑆𝑤𝑆 ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → 𝑥 = 𝑤)))
19 breq1 3964 . . . 4 (𝑥 = 𝑤 → (𝑥𝑦𝑤𝑦))
2019ralbidv 2454 . . 3 (𝑥 = 𝑤 → (∀𝑦𝑆 𝑥𝑦 ↔ ∀𝑦𝑆 𝑤𝑦))
2120reu4 2902 . 2 (∃!𝑥𝑆𝑦𝑆 𝑥𝑦 ↔ (∃𝑥𝑆𝑦𝑆 𝑥𝑦 ∧ ∀𝑥𝑆𝑤𝑆 ((∀𝑦𝑆 𝑥𝑦 ∧ ∀𝑦𝑆 𝑤𝑦) → 𝑥 = 𝑤)))
2218, 21sylibr 133 1 ((𝑆 ⊆ ℝ ∧ ∃𝑥𝑆𝑦𝑆 𝑥𝑦) → ∃!𝑥𝑆𝑦𝑆 𝑥𝑦)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∈ wcel 2125  ∀wral 2432  ∃wrex 2433  ∃!wreu 2434   ⊆ wss 3098   class class class wbr 3961  ℝcr 7710   ≤ cle 7892 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-sep 4078  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490  ax-cnex 7802  ax-resscn 7803  ax-pre-ltirr 7823  ax-pre-apti 7826 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-nel 2420  df-ral 2437  df-rex 2438  df-reu 2439  df-rmo 2440  df-rab 2441  df-v 2711  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-br 3962  df-opab 4022  df-xp 4585  df-cnv 4587  df-pnf 7893  df-mnf 7894  df-xr 7895  df-ltxr 7896  df-le 7897 This theorem is referenced by:  lbcl  8796  lble  8797
 Copyright terms: Public domain W3C validator