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

Theorem sbnfc2 4400
Description: Two ways of expressing "𝑥 is (effectively) not free in 𝐴". (Contributed by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
sbnfc2 (𝑥𝐴 ↔ ∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
Distinct variable groups:   𝑥,𝑦,𝑧   𝑦,𝐴,𝑧
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem sbnfc2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 vex 3457 . . . . 5 𝑦 ∈ V
2 csbtt 3867 . . . . 5 ((𝑦 ∈ V ∧ 𝑥𝐴) → 𝑦 / 𝑥𝐴 = 𝐴)
31, 2mpan 703 . . . 4 (𝑥𝐴𝑦 / 𝑥𝐴 = 𝐴)
4 vex 3457 . . . . 5 𝑧 ∈ V
5 csbtt 3867 . . . . 5 ((𝑧 ∈ V ∧ 𝑥𝐴) → 𝑧 / 𝑥𝐴 = 𝐴)
64, 5mpan 703 . . . 4 (𝑥𝐴𝑧 / 𝑥𝐴 = 𝐴)
73, 6eqtr4d 2800 . . 3 (𝑥𝐴𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
87alrimivv 1961 . 2 (𝑥𝐴 → ∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
9 nfv 1947 . . 3 𝑤𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴
10 eleq2 2851 . . . . . 6 (𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴 → (𝑤𝑦 / 𝑥𝐴𝑤𝑧 / 𝑥𝐴))
11 sbsbc 3746 . . . . . . 7 ([𝑦 / 𝑥]𝑤𝐴[𝑦 / 𝑥]𝑤𝐴)
12 sbcel2 4379 . . . . . . 7 ([𝑦 / 𝑥]𝑤𝐴𝑤𝑦 / 𝑥𝐴)
1311, 12bitri 278 . . . . . 6 ([𝑦 / 𝑥]𝑤𝐴𝑤𝑦 / 𝑥𝐴)
14 sbsbc 3746 . . . . . . 7 ([𝑧 / 𝑥]𝑤𝐴[𝑧 / 𝑥]𝑤𝐴)
15 sbcel2 4379 . . . . . . 7 ([𝑧 / 𝑥]𝑤𝐴𝑤𝑧 / 𝑥𝐴)
1614, 15bitri 278 . . . . . 6 ([𝑧 / 𝑥]𝑤𝐴𝑤𝑧 / 𝑥𝐴)
1710, 13, 163bitr4g 317 . . . . 5 (𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴 → ([𝑦 / 𝑥]𝑤𝐴 ↔ [𝑧 / 𝑥]𝑤𝐴))
18172alimi 1845 . . . 4 (∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴 → ∀𝑦𝑧([𝑦 / 𝑥]𝑤𝐴 ↔ [𝑧 / 𝑥]𝑤𝐴))
19 sbnf2 2389 . . . 4 (Ⅎ𝑥 𝑤𝐴 ↔ ∀𝑦𝑧([𝑦 / 𝑥]𝑤𝐴 ↔ [𝑧 / 𝑥]𝑤𝐴))
2018, 19sylibr 237 . . 3 (∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴 → Ⅎ𝑥 𝑤𝐴)
219, 20nfcd 2917 . 2 (∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴𝑥𝐴)
228, 21impbii 212 1 (𝑥𝐴 ↔ ∀𝑦𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wal 1568   = wceq 1570  wnf 1816  [wsb 2099  wcel 2145  wnfc 2909  Vcvv 3453  [wsbc 3742  csb 3850
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-nul 4283
This theorem is used by:  eusvnf  5361
  Copyright terms: Public domain W3C validator