MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssxr Structured version   Visualization version   GIF version

Theorem ssxr 11280
Description: The three (non-exclusive) possibilities implied by a subset of extended reals. (Contributed by NM, 25-Oct-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
Assertion
Ref Expression
ssxr (𝐴 ⊆ ℝ* → (𝐴 ⊆ ℝ ∨ +∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴))

Proof of Theorem ssxr
StepHypRef Expression
1 df-pr 4593 . . . . . . 7 {+∞, -∞} = ({+∞} ∪ {-∞})
21ineq2i 4171 . . . . . 6 (𝐴 ∩ {+∞, -∞}) = (𝐴 ∩ ({+∞} ∪ {-∞}))
3 indi 4238 . . . . . 6 (𝐴 ∩ ({+∞} ∪ {-∞})) = ((𝐴 ∩ {+∞}) ∪ (𝐴 ∩ {-∞}))
42, 3eqtri 2786 . . . . 5 (𝐴 ∩ {+∞, -∞}) = ((𝐴 ∩ {+∞}) ∪ (𝐴 ∩ {-∞}))
5 disjsn 4678 . . . . . . . 8 ((𝐴 ∩ {+∞}) = ∅ ↔ ¬ +∞ ∈ 𝐴)
6 disjsn 4678 . . . . . . . 8 ((𝐴 ∩ {-∞}) = ∅ ↔ ¬ -∞ ∈ 𝐴)
75, 6anbi12i 639 . . . . . . 7 (((𝐴 ∩ {+∞}) = ∅ ∧ (𝐴 ∩ {-∞}) = ∅) ↔ (¬ +∞ ∈ 𝐴 ∧ ¬ -∞ ∈ 𝐴))
87biimpri 231 . . . . . 6 ((¬ +∞ ∈ 𝐴 ∧ ¬ -∞ ∈ 𝐴) → ((𝐴 ∩ {+∞}) = ∅ ∧ (𝐴 ∩ {-∞}) = ∅))
9 pm4.56 1004 . . . . . 6 ((¬ +∞ ∈ 𝐴 ∧ ¬ -∞ ∈ 𝐴) ↔ ¬ (+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴))
10 un00 4365 . . . . . 6 (((𝐴 ∩ {+∞}) = ∅ ∧ (𝐴 ∩ {-∞}) = ∅) ↔ ((𝐴 ∩ {+∞}) ∪ (𝐴 ∩ {-∞})) = ∅)
118, 9, 103imtr3i 294 . . . . 5 (¬ (+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) → ((𝐴 ∩ {+∞}) ∪ (𝐴 ∩ {-∞})) = ∅)
124, 11eqtrid 2810 . . . 4 (¬ (+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) → (𝐴 ∩ {+∞, -∞}) = ∅)
13 reldisj 4414 . . . . 5 (𝐴 ⊆ (ℝ ∪ {+∞, -∞}) → ((𝐴 ∩ {+∞, -∞}) = ∅ ↔ 𝐴 ⊆ ((ℝ ∪ {+∞, -∞}) ∖ {+∞, -∞})))
14 renfdisj 11270 . . . . . . . 8 (ℝ ∩ {+∞, -∞}) = ∅
15 disj3 4415 . . . . . . . 8 ((ℝ ∩ {+∞, -∞}) = ∅ ↔ ℝ = (ℝ ∖ {+∞, -∞}))
1614, 15mpbi 233 . . . . . . 7 ℝ = (ℝ ∖ {+∞, -∞})
17 difun2 4443 . . . . . . 7 ((ℝ ∪ {+∞, -∞}) ∖ {+∞, -∞}) = (ℝ ∖ {+∞, -∞})
1816, 17eqtr4i 2789 . . . . . 6 ℝ = ((ℝ ∪ {+∞, -∞}) ∖ {+∞, -∞})
1918sseq2i 3967 . . . . 5 (𝐴 ⊆ ℝ ↔ 𝐴 ⊆ ((ℝ ∪ {+∞, -∞}) ∖ {+∞, -∞}))
2013, 19bitr4di 292 . . . 4 (𝐴 ⊆ (ℝ ∪ {+∞, -∞}) → ((𝐴 ∩ {+∞, -∞}) = ∅ ↔ 𝐴 ⊆ ℝ))
2112, 20imbitrid 247 . . 3 (𝐴 ⊆ (ℝ ∪ {+∞, -∞}) → (¬ (+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) → 𝐴 ⊆ ℝ))
2221orrd 876 . 2 (𝐴 ⊆ (ℝ ∪ {+∞, -∞}) → ((+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) ∨ 𝐴 ⊆ ℝ))
23 df-xr 11248 . . 3 * = (ℝ ∪ {+∞, -∞})
2423sseq2i 3967 . 2 (𝐴 ⊆ ℝ*𝐴 ⊆ (ℝ ∪ {+∞, -∞}))
25 3orrot 1108 . . 3 ((𝐴 ⊆ ℝ ∨ +∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) ↔ (+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴𝐴 ⊆ ℝ))
26 df-3or 1104 . . 3 ((+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴𝐴 ⊆ ℝ) ↔ ((+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) ∨ 𝐴 ⊆ ℝ))
2725, 26bitri 278 . 2 ((𝐴 ⊆ ℝ ∨ +∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) ↔ ((+∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴) ∨ 𝐴 ⊆ ℝ))
2822, 24, 273imtr4i 295 1 (𝐴 ⊆ ℝ* → (𝐴 ⊆ ℝ ∨ +∞ ∈ 𝐴 ∨ -∞ ∈ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wo 860  w3o 1102   = wceq 1570  wcel 2143  cdif 3903  cun 3904  cin 3905  wss 3906  c0 4287  {csn 4590  {cpr 4592  cr 11100  +∞cpnf 11241  -∞cmnf 11242  *cxr 11243
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-resscn 11158
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-er 8695  df-en 8945  df-dom 8946  df-sdom 8947  df-pnf 11246  df-mnf 11247  df-xr 11248
This theorem is referenced by:  xrsupss  13336  xrinfmss  13337  xrssre  46044
  Copyright terms: Public domain W3C validator