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

Theorem iccsupr 9700
 Description: A nonempty subset of a closed real interval satisfies the conditions for the existence of its supremum. To be useful without excluded middle, we'll probably need to change not equal to apart, and perhaps make other changes, but the theorem does hold as stated here. (Contributed by Paul Chapman, 21-Jan-2008.)
Assertion
Ref Expression
iccsupr (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥))
Distinct variable groups:   𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐶(𝑥,𝑦)

Proof of Theorem iccsupr
StepHypRef Expression
1 iccssre 9689 . . . 4 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
2 sstr 3073 . . . . 5 ((𝑆 ⊆ (𝐴[,]𝐵) ∧ (𝐴[,]𝐵) ⊆ ℝ) → 𝑆 ⊆ ℝ)
32ancoms 266 . . . 4 (((𝐴[,]𝐵) ⊆ ℝ ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → 𝑆 ⊆ ℝ)
41, 3sylan 279 . . 3 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → 𝑆 ⊆ ℝ)
543adant3 984 . 2 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → 𝑆 ⊆ ℝ)
6 ne0i 3337 . . 3 (𝐶𝑆𝑆 ≠ ∅)
763ad2ant3 987 . 2 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → 𝑆 ≠ ∅)
8 simplr 502 . . . 4 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
9 ssel 3059 . . . . . . . 8 (𝑆 ⊆ (𝐴[,]𝐵) → (𝑦𝑆𝑦 ∈ (𝐴[,]𝐵)))
10 elicc2 9672 . . . . . . . . 9 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴𝑦𝑦𝐵)))
1110biimpd 143 . . . . . . . 8 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) → (𝑦 ∈ ℝ ∧ 𝐴𝑦𝑦𝐵)))
129, 11sylan9r 405 . . . . . . 7 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → (𝑦𝑆 → (𝑦 ∈ ℝ ∧ 𝐴𝑦𝑦𝐵)))
1312imp 123 . . . . . 6 ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) ∧ 𝑦𝑆) → (𝑦 ∈ ℝ ∧ 𝐴𝑦𝑦𝐵))
1413simp3d 978 . . . . 5 ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) ∧ 𝑦𝑆) → 𝑦𝐵)
1514ralrimiva 2480 . . . 4 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → ∀𝑦𝑆 𝑦𝐵)
16 breq2 3901 . . . . . 6 (𝑥 = 𝐵 → (𝑦𝑥𝑦𝐵))
1716ralbidv 2412 . . . . 5 (𝑥 = 𝐵 → (∀𝑦𝑆 𝑦𝑥 ↔ ∀𝑦𝑆 𝑦𝐵))
1817rspcev 2761 . . . 4 ((𝐵 ∈ ℝ ∧ ∀𝑦𝑆 𝑦𝐵) → ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥)
198, 15, 18syl2anc 406 . . 3 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵)) → ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥)
20193adant3 984 . 2 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥)
215, 7, 203jca 1144 1 (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 945   = wceq 1314   ∈ wcel 1463   ≠ wne 2283  ∀wral 2391  ∃wrex 2392   ⊆ wss 3039  ∅c0 3331   class class class wbr 3897  (class class class)co 5740  ℝcr 7583   ≤ cle 7765  [,]cicc 9625 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 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-pow 4066  ax-pr 4099  ax-un 4323  ax-setind 4420  ax-cnex 7675  ax-resscn 7676  ax-pre-ltirr 7696  ax-pre-ltwlin 7697  ax-pre-lttrn 7698 This theorem depends on definitions:  df-bi 116  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-nel 2379  df-ral 2396  df-rex 2397  df-rab 2400  df-v 2660  df-sbc 2881  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-nul 3332  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-br 3898  df-opab 3958  df-id 4183  df-po 4186  df-iso 4187  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-iota 5056  df-fun 5093  df-fv 5099  df-ov 5743  df-oprab 5744  df-mpo 5745  df-pnf 7766  df-mnf 7767  df-xr 7768  df-ltxr 7769  df-le 7770  df-icc 9629 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator