 Mathbox for BJ < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-spcimdvv Structured version   Visualization version   GIF version

Theorem bj-spcimdvv 33208
 Description: Remove from spcimdv 3439 dependency on ax-7 2092, ax-8 2146, ax-10 2173, ax-11 2189, ax-12 2202 ax-13 2407, ax-ext 2750, df-cleq 2763, df-clab 2757 (and df-nfc 2901, df-v 3351, df-or 827, df-tru 1633, df-nf 1857) at the price of adding a DV condition on 𝑥, 𝐵 (but in usages, 𝑥 is typically a dummy, hence fresh, variable). For the version without this DV condition, see bj-spcimdv 33207. (Contributed by BJ, 3-Nov-2021.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
bj-spcimdvv.1 (𝜑𝐴𝐵)
bj-spcimdvv.2 ((𝜑𝑥 = 𝐴) → (𝜓𝜒))
Assertion
Ref Expression
bj-spcimdvv (𝜑 → (∀𝑥𝜓𝜒))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥   𝜒,𝑥
Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem bj-spcimdvv
StepHypRef Expression
1 bj-spcimdvv.2 . . . 4 ((𝜑𝑥 = 𝐴) → (𝜓𝜒))
21ex 397 . . 3 (𝜑 → (𝑥 = 𝐴 → (𝜓𝜒)))
32alrimiv 2006 . 2 (𝜑 → ∀𝑥(𝑥 = 𝐴 → (𝜓𝜒)))
4 bj-spcimdvv.1 . 2 (𝜑𝐴𝐵)
5 bj-elissetv 33184 . . . 4 (𝐴𝐵 → ∃𝑥 𝑥 = 𝐴)
6 exim 1908 . . . 4 (∀𝑥(𝑥 = 𝐴 → (𝜓𝜒)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜓𝜒)))
75, 6syl5 34 . . 3 (∀𝑥(𝑥 = 𝐴 → (𝜓𝜒)) → (𝐴𝐵 → ∃𝑥(𝜓𝜒)))
8 19.36v 2071 . . 3 (∃𝑥(𝜓𝜒) ↔ (∀𝑥𝜓𝜒))
97, 8syl6ib 241 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜓𝜒)) → (𝐴𝐵 → (∀𝑥𝜓𝜒)))
103, 4, 9sylc 65 1 (𝜑 → (∀𝑥𝜓𝜒))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382  ∀wal 1628   = wceq 1630  ∃wex 1851   ∈ wcel 2144 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056 This theorem depends on definitions:  df-bi 197  df-an 383  df-ex 1852  df-clel 2766 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator