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

Theorem elicores 40180
 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 12295 . . . . . 6 [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
21reseq1i 5499 . . . . 5 ([,) ↾ (ℝ × ℝ)) = ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ))
3 ressxr 10196 . . . . . 6 ℝ ⊆ ℝ*
4 resmpt2 6875 . . . . . 6 ((ℝ ⊆ ℝ* ∧ ℝ ⊆ ℝ*) → ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
53, 3, 4mp2an 710 . . . . 5 ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
62, 5eqtri 2746 . . . 4 ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
76rneqi 5459 . . 3 ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
87eleq2i 2795 . 2 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ 𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
9 eqid 2724 . . 3 (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
10 xrex 11943 . . . 4 * ∈ V
1110rabex 4920 . . 3 {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ∈ V
129, 11elrnmpt2 6890 . 2 (𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
133sseli 3705 . . . . . . . 8 (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*)
1413adantr 472 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℝ*)
153sseli 3705 . . . . . . . 8 (𝑦 ∈ ℝ → 𝑦 ∈ ℝ*)
1615adantl 473 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ*)
17 icoval 12327 . . . . . . 7 ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1814, 16, 17syl2anc 696 . . . . . 6 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1918eqcomd 2730 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} = (𝑥[,)𝑦))
2019eqeq2d 2734 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ 𝐴 = (𝑥[,)𝑦)))
2120rexbidva 3151 . . 3 (𝑥 ∈ ℝ → (∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦)))
2221rexbiia 3142 . 2 (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
238, 12, 223bitri 286 1 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   = wceq 1596   ∈ wcel 2103  ∃wrex 3015  {crab 3018   ⊆ wss 3680   class class class wbr 4760   × cxp 5216  ran crn 5219   ↾ cres 5220  (class class class)co 6765   ↦ cmpt2 6767  ℝcr 10048  ℝ*cxr 10186   < clt 10187   ≤ cle 10188  [,)cico 12291 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-8 2105  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704  ax-sep 4889  ax-nul 4897  ax-pr 5011  ax-un 7066  ax-cnex 10105  ax-resscn 10106 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-eu 2575  df-mo 2576  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ral 3019  df-rex 3020  df-rab 3023  df-v 3306  df-sbc 3542  df-dif 3683  df-un 3685  df-in 3687  df-ss 3694  df-nul 4024  df-if 4195  df-sn 4286  df-pr 4288  df-op 4292  df-uni 4545  df-br 4761  df-opab 4821  df-id 5128  df-xp 5224  df-rel 5225  df-cnv 5226  df-co 5227  df-dm 5228  df-rn 5229  df-res 5230  df-iota 5964  df-fun 6003  df-fv 6009  df-ov 6768  df-oprab 6769  df-mpt2 6770  df-xr 10191  df-ico 12295 This theorem is referenced by:  icoresmbl  41180
 Copyright terms: Public domain W3C validator