Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj211OLD 12505
Description: First-order logic and set theory.
Assertion
Ref Expression
bnj211OLD |- (Y e. _V -> ([Y / x]x Fn Z <-> Y Fn Z))
Distinct variable group:   x,Z

Proof of Theorem bnj211OLD
StepHypRef Expression
1 dfsbcq 2455 . . 3 |- (Y = if(Y e. _V, Y, (/)) -> ([Y / x]x Fn Z <-> [if(Y e. _V, Y, (/)) / x]x Fn Z))
2 fneq1 4503 . . 3 |- (Y = if(Y e. _V, Y, (/)) -> (Y Fn Z <-> if(Y e. _V, Y, (/)) Fn Z))
31, 2bibi12d 691 . 2 |- (Y = if(Y e. _V, Y, (/)) -> (([Y / x]x Fn Z <-> Y Fn Z) <-> ([if(Y e. _V, Y, (/)) / x]x Fn Z <-> if(Y e. _V, Y, (/)) Fn Z)))
4 0ex 3446 . . . 4 |- (/) e. _V
54elimel 3025 . . 3 |- if(Y e. _V, Y, (/)) e. _V
65bnj99 12450 . 2 |- ([if(Y e. _V, Y, (/)) / x]x Fn Z <-> if(Y e. _V, Y, (/)) Fn Z)
73, 6dedth 3011 1 |- (Y e. _V -> ([Y / x]x Fn Z <-> Y Fn Z))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   = wceq 1298   e. wcel 1300  [wsbc 1534  _Vcvv 2292  (/)c0 2875  ifcif 2982   Fn wfn 3993
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-sbc 2454  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-if 2983  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-br 3339  df-opab 3396  df-id 3586  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-fun 4008  df-fn 4009
Copyright terms: Public domain