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

Theorem sbcg 3814
Description: Substitution for a variable not occurring in a wff does not affect it. Distinct variable form of sbcgf 3812. (Contributed by Alan Sare, 10-Nov-2012.) Reduce axiom usage. (Revised by GG, 12-Oct-2024.)
Assertion
Ref Expression
sbcg (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜑))
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥)

Proof of Theorem sbcg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-sbc 3743 . . 3 ([𝐴 / 𝑥]𝜑 ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})
2 dfclel 2840 . . 3 (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}))
3 df-clab 2742 . . . . . 6 (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
4 sbv 2127 . . . . . 6 ([𝑦 / 𝑥]𝜑 ↔ 𝜑)
53, 4bitri 278 . . . . 5 (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
65anbi2i 635 . . . 4 ((𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ (𝑦 = 𝐴 ∧ 𝜑))
76exbii 1881 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝜑))
81, 2, 73bitrri 301 . 2 (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ [𝐴 / 𝑥]𝜑)
9 dfclel 2840 . . . 4 (𝐴 ∈ 𝑉 ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
109biimpi 219 . . 3 (𝐴 ∈ 𝑉 → ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
11 simpr 490 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
1211ax-gen 1828 . . . . 5 ∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
13 19.23v 1977 . . . . . 6 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) ↔ (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1413biimpi 219 . . . . 5 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1512, 14mp1i 14 . . . 4 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
16 2a1 29 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦 ∈ 𝑉 → (𝜑 → 𝑦 = 𝐴)))
1716imp 412 . . . . . . 7 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → 𝑦 = 𝐴))
1817ancrd 561 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
1918eximi 1868 . . . . 5 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → ∃𝑦(𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
20 19.37imv 1982 . . . . 5 (∃𝑦(𝜑 → (𝑦 = 𝐴 ∧ 𝜑)) → (𝜑 → ∃𝑦(𝑦 = 𝐴 ∧ 𝜑)))
2119, 20syl 18 . . . 4 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → ∃𝑦(𝑦 = 𝐴 ∧ 𝜑)))
2215, 21impbid 215 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ 𝜑))
2310, 22syl 18 . 2 (𝐴 ∈ 𝑉 → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ 𝜑))
248, 23bitr3id 288 1 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  [wsb 2101   ∈ wcel 2147  {cab 2741  [wsbc 3742
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 1945  ax-6 2002  ax-7 2043  ax-8 2149
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2102  df-clab 2742  df-clel 2839  df-sbc 3743
This theorem is used by:  sbcfal  3816  sbcabel  3829  csbconstg  3870  2nreu  4405  csbuni  4901  csbxp  5757  sbcfungOLD  6584  fmptsnd  7197  f1od2  8135  csbfrecsg  8330  opsbc2ie  33144  bnj89  35422  bnj525  35439  bnj1128  35690  csbrdgg  38444  csboprabg  38445  mptsnunlem  38453  topdifinffinlem  38462  relowlpssretop  38479  rdgeqoa  38485  csbfinxpg  38503  gm-sbtru  39230  sbfal  39231  cdlemk40  42166  cdlemkid3N  42182  cdlemkid4  42183  frege70  45125  frege77  45132  frege116  45171  frege118  45173  trsbc  45714  trsbcVD  46050  csbxpgVD  46067  csbunigVD  46071
  Copyright terms: Public domain W3C validator