Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elex22VD Structured version   Visualization version   GIF version

Theorem elex22VD 45821
Description: Virtual deduction proof of elex22 3474. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
elex22VD ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem elex22VD
StepHypRef Expression
1 idn1 45557 . . . . 5 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   )
2 simpl 488 . . . . 5 ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝐵)
31, 2e1a 45610 . . . 4 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   𝐴 ∈ 𝐵   )
4 elisset 2842 . . . 4 (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴)
53, 4e1a 45610 . . 3 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   ∃𝑥 𝑥 = 𝐴   )
6 idn2 45596 . . . . . . . 8 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ,   𝑥 = 𝐴   ▶   𝑥 = 𝐴   )
7 eleq1a 2855 . . . . . . . 8 (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
83, 6, 7e12 45706 . . . . . . 7 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ,   𝑥 = 𝐴   ▶   𝑥 ∈ 𝐵   )
9 simpr 490 . . . . . . . . 9 ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝐶)
101, 9e1a 45610 . . . . . . . 8 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   𝐴 ∈ 𝐶   )
11 eleq1a 2855 . . . . . . . 8 (𝐴 ∈ 𝐶 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐶))
1210, 6, 11e12 45706 . . . . . . 7 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ,   𝑥 = 𝐴   ▶   𝑥 ∈ 𝐶   )
13 pm3.2 475 . . . . . . 7 (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)))
148, 12, 13e22 45654 . . . . . 6 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ,   𝑥 = 𝐴   ▶   (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)   )
1514in2 45588 . . . . 5 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))   )
1615gen11 45599 . . . 4 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   ∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))   )
17 exim 1866 . . . 4 (∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)))
1816, 17e1a 45610 . . 3 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))   )
19 pm2.27 43 . . 3 (∃𝑥 𝑥 = 𝐴 → ((∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)))
205, 18, 19e11 45671 . 2 (   (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)   ▶   ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)   )
2120in1 45554 1 ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144
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-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-vd1 45553  df-vd2 45561
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator