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

Theorem rnmptpr 46191
Description: Range of a function defined on an unordered pair. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
rnmptpr.a (𝜑 → 𝐴 ∈ 𝑉)
rnmptpr.b (𝜑 → 𝐵 ∈ 𝑊)
rnmptpr.f 𝐹 = (𝑥 ∈ {𝐴, 𝐵} ↦ 𝐶)
rnmptpr.d (𝑥 = 𝐴 → 𝐶 = 𝐷)
rnmptpr.e (𝑥 = 𝐵 → 𝐶 = 𝐸)
Assertion
Ref Expression
rnmptpr (𝜑 → ran 𝐹 = {𝐷, 𝐸})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝐸
Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem rnmptpr
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 rnmptpr.a . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
2 rnmptpr.b . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
3 rnmptpr.d . . . . . 6 (𝑥 = 𝐴 → 𝐶 = 𝐷)
43eqeq2d 2772 . . . . 5 (𝑥 = 𝐴 → (𝑦 = 𝐶 ↔ 𝑦 = 𝐷))
5 rnmptpr.e . . . . . 6 (𝑥 = 𝐵 → 𝐶 = 𝐸)
65eqeq2d 2772 . . . . 5 (𝑥 = 𝐵 → (𝑦 = 𝐶 ↔ 𝑦 = 𝐸))
74, 6rexprg 4658 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 ∈ {𝐴, 𝐵}𝑦 = 𝐶 ↔ (𝑦 = 𝐷 ∨ 𝑦 = 𝐸)))
81, 2, 7syl2anc 596 . . 3 (𝜑 → (∃𝑥 ∈ {𝐴, 𝐵}𝑦 = 𝐶 ↔ (𝑦 = 𝐷 ∨ 𝑦 = 𝐸)))
9 rnmptpr.f . . . . 5 𝐹 = (𝑥 ∈ {𝐴, 𝐵} ↦ 𝐶)
109elrnmpt 5940 . . . 4 (𝑦 ∈ V → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ {𝐴, 𝐵}𝑦 = 𝐶))
1110elv 3456 . . 3 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ {𝐴, 𝐵}𝑦 = 𝐶)
12 vex 3455 . . . 4 𝑦 ∈ V
1312elpr 4609 . . 3 (𝑦 ∈ {𝐷, 𝐸} ↔ (𝑦 = 𝐷 ∨ 𝑦 = 𝐸))
148, 11, 133bitr4g 317 . 2 (𝜑 → (𝑦 ∈ ran 𝐹 ↔ 𝑦 ∈ {𝐷, 𝐸}))
1514eqrdv 2759 1 (𝜑 → ran 𝐹 = {𝐷, 𝐸})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451  {cpr 4586   ↦ cmpt 5186  ran crn 5652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-mpt 5187  df-cnv 5659  df-dm 5661  df-rn 5662
This theorem is used by:  sge0pr  47403
  Copyright terms: Public domain W3C validator