Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elicores Structured version   Visualization version   GIF version

Theorem elicores 38607
Description: Membership in a left-closed, right-open interval with real bounds. (Contributed by Glauco Siliprandi, 11-Oct-2020.)
Assertion
Ref Expression
elicores (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem elicores
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-ico 12052 . . . . . 6 [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
21reseq1i 5313 . . . . 5 ([,) ↾ (ℝ × ℝ)) = ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ))
3 ressxr 9962 . . . . . 6 ℝ ⊆ ℝ*
4 resmpt2 6656 . . . . . 6 ((ℝ ⊆ ℝ* ∧ ℝ ⊆ ℝ*) → ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
53, 3, 4mp2an 704 . . . . 5 ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
62, 5eqtri 2632 . . . 4 ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
76rneqi 5273 . . 3 ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
87eleq2i 2680 . 2 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ 𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
9 eqid 2610 . . 3 (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
10 xrex 11705 . . . 4 * ∈ V
1110rabex 4740 . . 3 {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ∈ V
129, 11elrnmpt2 6671 . 2 (𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
133sseli 3564 . . . . . . . 8 (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*)
1413adantr 480 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℝ*)
153sseli 3564 . . . . . . . 8 (𝑦 ∈ ℝ → 𝑦 ∈ ℝ*)
1615adantl 481 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ*)
17 icoval 12084 . . . . . . 7 ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1814, 16, 17syl2anc 691 . . . . . 6 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1918eqcomd 2616 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} = (𝑥[,)𝑦))
2019eqeq2d 2620 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ 𝐴 = (𝑥[,)𝑦)))
2120rexbidva 3031 . . 3 (𝑥 ∈ ℝ → (∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦)))
2221rexbiia 3022 . 2 (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
238, 12, 223bitri 285 1 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 195  wa 383   = wceq 1475  wcel 1977  wrex 2897  {crab 2900  wss 3540   class class class wbr 4583   × cxp 5036  ran crn 5039  cres 5040  (class class class)co 6549  cmpt2 6551  cr 9814  *cxr 9952   < clt 9953  cle 9954  [,)cico 12048
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-xr 9957  df-ico 12052
This theorem is referenced by:  icoresmbl  39433
  Copyright terms: Public domain W3C validator