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

Theorem elpreqprlem 4820
Description: Lemma for elpreqpr 4821. (Contributed by Scott Fenton, 7-Dec-2020.) (Revised by AV, 9-Dec-2020.)
Assertion
Ref Expression
elpreqprlem (𝐵 ∈ 𝑉 → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥})
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem elpreqprlem
StepHypRef Expression
1 eqid 2760 . . . 4 {𝐵, 𝐶} = {𝐵, 𝐶}
2 preq2 4691 . . . . . 6 (𝑥 = 𝐶 → {𝐵, 𝑥} = {𝐵, 𝐶})
32eqeq2d 2771 . . . . 5 (𝑥 = 𝐶 → ({𝐵, 𝐶} = {𝐵, 𝑥} ↔ {𝐵, 𝐶} = {𝐵, 𝐶}))
43spcegv 3551 . . . 4 (𝐶 ∈ V → ({𝐵, 𝐶} = {𝐵, 𝐶} → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥}))
51, 4mpi 21 . . 3 (𝐶 ∈ V → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥})
65a1d 26 . 2 (𝐶 ∈ V → (𝐵 ∈ 𝑉 → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥}))
7 dfsn2 4593 . . . 4 {𝐵} = {𝐵, 𝐵}
8 preq2 4691 . . . . . 6 (𝑥 = 𝐵 → {𝐵, 𝑥} = {𝐵, 𝐵})
98eqeq2d 2771 . . . . 5 (𝑥 = 𝐵 → ({𝐵} = {𝐵, 𝑥} ↔ {𝐵} = {𝐵, 𝐵}))
109spcegv 3551 . . . 4 (𝐵 ∈ 𝑉 → ({𝐵} = {𝐵, 𝐵} → ∃𝑥{𝐵} = {𝐵, 𝑥}))
117, 10mpi 21 . . 3 (𝐵 ∈ 𝑉 → ∃𝑥{𝐵} = {𝐵, 𝑥})
12 prprc2 4723 . . . . 5 (¬ 𝐶 ∈ V → {𝐵, 𝐶} = {𝐵})
1312eqeq1d 2762 . . . 4 (¬ 𝐶 ∈ V → ({𝐵, 𝐶} = {𝐵, 𝑥} ↔ {𝐵} = {𝐵, 𝑥}))
1413exbidv 1953 . . 3 (¬ 𝐶 ∈ V → (∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥} ↔ ∃𝑥{𝐵} = {𝐵, 𝑥}))
1511, 14imbitrrid 249 . 2 (¬ 𝐶 ∈ V → (𝐵 ∈ 𝑉 → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥}))
166, 15pm2.61i 184 1 (𝐵 ∈ 𝑉 → ∃𝑥{𝐵, 𝐶} = {𝐵, 𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569  ∃wex 1811   ∈ wcel 2144  Vcvv 3450  {csn 4584  {cpr 4586
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-dif 4046  df-un 4150  df-nul 4278  df-sn 4585  df-pr 4587
This theorem is used by:  elpreqpr  4821
  Copyright terms: Public domain W3C validator