Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj23 Structured version   Visualization version   GIF version

Theorem bnj23 34910
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Mario Carneiro, 22-Dec-2016.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj23.1 𝐵 = {𝑥𝐴 ∣ ¬ 𝜑}
Assertion
Ref Expression
bnj23 (∀𝑧𝐵 ¬ 𝑧𝑅𝑦 → ∀𝑤𝐴 (𝑤𝑅𝑦[𝑤 / 𝑥]𝜑))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴,𝑧   𝑤,𝐵,𝑦,𝑧   𝑤,𝑅,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐴(𝑤)   𝐵(𝑥)   𝑅(𝑥)

Proof of Theorem bnj23
StepHypRef Expression
1 sbcng 3770 . . . . 5 (𝑤 ∈ V → ([𝑤 / 𝑥] ¬ 𝜑 ↔ ¬ [𝑤 / 𝑥]𝜑))
21elv 3436 . . . 4 ([𝑤 / 𝑥] ¬ 𝜑 ↔ ¬ [𝑤 / 𝑥]𝜑)
3 bnj23.1 . . . . . . . 8 𝐵 = {𝑥𝐴 ∣ ¬ 𝜑}
43eleq2i 2831 . . . . . . 7 (𝑤𝐵𝑤 ∈ {𝑥𝐴 ∣ ¬ 𝜑})
5 nfcv 2901 . . . . . . . 8 𝑥𝐴
65elrabsf 3768 . . . . . . 7 (𝑤 ∈ {𝑥𝐴 ∣ ¬ 𝜑} ↔ (𝑤𝐴[𝑤 / 𝑥] ¬ 𝜑))
74, 6bitri 276 . . . . . 6 (𝑤𝐵 ↔ (𝑤𝐴[𝑤 / 𝑥] ¬ 𝜑))
8 breq1 5076 . . . . . . . 8 (𝑧 = 𝑤 → (𝑧𝑅𝑦𝑤𝑅𝑦))
98notbid 319 . . . . . . 7 (𝑧 = 𝑤 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑤𝑅𝑦))
109rspccv 3557 . . . . . 6 (∀𝑧𝐵 ¬ 𝑧𝑅𝑦 → (𝑤𝐵 → ¬ 𝑤𝑅𝑦))
117, 10biimtrrid 244 . . . . 5 (∀𝑧𝐵 ¬ 𝑧𝑅𝑦 → ((𝑤𝐴[𝑤 / 𝑥] ¬ 𝜑) → ¬ 𝑤𝑅𝑦))
1211expdimp 453 . . . 4 ((∀𝑧𝐵 ¬ 𝑧𝑅𝑦𝑤𝐴) → ([𝑤 / 𝑥] ¬ 𝜑 → ¬ 𝑤𝑅𝑦))
132, 12biimtrrid 244 . . 3 ((∀𝑧𝐵 ¬ 𝑧𝑅𝑦𝑤𝐴) → (¬ [𝑤 / 𝑥]𝜑 → ¬ 𝑤𝑅𝑦))
1413con4d 115 . 2 ((∀𝑧𝐵 ¬ 𝑧𝑅𝑦𝑤𝐴) → (𝑤𝑅𝑦[𝑤 / 𝑥]𝜑))
1514ralrimiva 3131 1 (∀𝑧𝐵 ¬ 𝑧𝑅𝑦 → ∀𝑤𝐴 (𝑤𝑅𝑦[𝑤 / 𝑥]𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wral 3053  {crab 3391  Vcvv 3431  [wsbc 3723   class class class wbr 5073
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4263  df-if 4456  df-sn 4557  df-pr 4559  df-op 4563  df-br 5074
This theorem is referenced by:  bnj110  35049
  Copyright terms: Public domain W3C validator