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 39760
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 12181 . . . . . 6 [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
21reseq1i 5392 . . . . 5 ([,) ↾ (ℝ × ℝ)) = ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ))
3 ressxr 10083 . . . . . 6 ℝ ⊆ ℝ*
4 resmpt2 6758 . . . . . 6 ((ℝ ⊆ ℝ* ∧ ℝ ⊆ ℝ*) → ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
53, 3, 4mp2an 708 . . . . 5 ((𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
62, 5eqtri 2644 . . . 4 ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
76rneqi 5352 . . 3 ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
87eleq2i 2693 . 2 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ 𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}))
9 eqid 2622 . . 3 (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
10 xrex 11829 . . . 4 * ∈ V
1110rabex 4813 . . 3 {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ∈ V
129, 11elrnmpt2 6773 . 2 (𝐴 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
133sseli 3599 . . . . . . . 8 (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*)
1413adantr 481 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℝ*)
153sseli 3599 . . . . . . . 8 (𝑦 ∈ ℝ → 𝑦 ∈ ℝ*)
1615adantl 482 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ*)
17 icoval 12213 . . . . . . 7 ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1814, 16, 17syl2anc 693 . . . . . 6 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥[,)𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)})
1918eqcomd 2628 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} = (𝑥[,)𝑦))
2019eqeq2d 2632 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ 𝐴 = (𝑥[,)𝑦)))
2120rexbidva 3049 . . 3 (𝑥 ∈ ℝ → (∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦)))
2221rexbiia 3040 . 2 (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = {𝑧 ∈ ℝ* ∣ (𝑥𝑧𝑧 < 𝑦)} ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
238, 12, 223bitri 286 1 (𝐴 ∈ ran ([,) ↾ (ℝ × ℝ)) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥[,)𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384   = wceq 1483  wcel 1990  wrex 2913  {crab 2916  wss 3574   class class class wbr 4653   × cxp 5112  ran crn 5115  cres 5116  (class class class)co 6650  cmpt2 6652  cr 9935  *cxr 10073   < clt 10074  cle 10075  [,)cico 12177
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-xr 10078  df-ico 12181
This theorem is referenced by:  icoresmbl  40757
  Copyright terms: Public domain W3C validator