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

Theorem sbcrext 3819
Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 1-Mar-2008.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) (Revised by NM, 18-Aug-2018.) (Proof shortened by JJ, 7-Jul-2021.)
Assertion
Ref Expression
sbcrext (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
Distinct variable groups:   𝑥,𝑦   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑦)

Proof of Theorem sbcrext
StepHypRef Expression
1 sbcex 3748 . . 3 ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 → 𝐴 ∈ V)
21a1i 11 . 2 (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 → 𝐴 ∈ V))
3 nfnfc1 2925 . . 3 Ⅎ𝑦Ⅎ𝑦𝐴
4 id 23 . . . 4 (Ⅎ𝑦𝐴 → Ⅎ𝑦𝐴)
5 nfcvd 2923 . . . 4 (Ⅎ𝑦𝐴 → Ⅎ𝑦V)
64, 5nfeld 2933 . . 3 (Ⅎ𝑦𝐴 → Ⅎ𝑦 𝐴 ∈ V)
7 sbcex 3748 . . . 4 ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
872a1i 12 . . 3 (Ⅎ𝑦𝐴 → (𝑦 ∈ 𝐵 → ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)))
93, 6, 8rexlimd2 3268 . 2 (Ⅎ𝑦𝐴 → (∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 → 𝐴 ∈ V))
10 sbcng 3785 . . . . . 6 (𝐴 ∈ V → ([𝐴 / 𝑥] ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ¬ [𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑))
1110adantl 487 . . . . 5 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥] ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ¬ [𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑))
12 sbcralt 3818 . . . . . . . 8 ((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥] ¬ 𝜑))
1312ancoms 464 . . . . . . 7 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥] ¬ 𝜑))
143, 6nfan1 2236 . . . . . . . 8 Ⅎ𝑦(Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V)
15 sbcng 3785 . . . . . . . . 9 (𝐴 ∈ V → ([𝐴 / 𝑥] ¬ 𝜑 ↔ ¬ [𝐴 / 𝑥]𝜑))
1615adantl 487 . . . . . . . 8 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥] ¬ 𝜑 ↔ ¬ [𝐴 / 𝑥]𝜑))
1714, 16ralbid 3275 . . . . . . 7 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → (∀𝑦 ∈ 𝐵 [𝐴 / 𝑥] ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 ¬ [𝐴 / 𝑥]𝜑))
1813, 17bitrd 282 . . . . . 6 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 ¬ [𝐴 / 𝑥]𝜑))
1918notbid 321 . . . . 5 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → (¬ [𝐴 / 𝑥]∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ [𝐴 / 𝑥]𝜑))
2011, 19bitrd 282 . . . 4 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥] ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ [𝐴 / 𝑥]𝜑))
21 dfrex2 3089 . . . . 5 (∃𝑦 ∈ 𝐵 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜑)
2221sbcbii 3794 . . . 4 ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥] ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜑)
23 dfrex2 3089 . . . 4 (∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ [𝐴 / 𝑥]𝜑)
2420, 22, 233bitr4g 317 . . 3 ((Ⅎ𝑦𝐴 ∧ 𝐴 ∈ V) → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
2524ex 418 . 2 (Ⅎ𝑦𝐴 → (𝐴 ∈ V → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)))
262, 9, 25pm5.21ndd 382 1 (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  Ⅎwnfc 2907  ∀wral 3076  ∃wrex 3086  Vcvv 3450  [wsbc 3738
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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-v 3452  df-sbc 3739
This theorem is used by:  sbcrex  3821
  Copyright terms: Public domain W3C validator