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

Theorem bnj941 32220
 Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj941.1 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
Assertion
Ref Expression
bnj941 (𝐶 ∈ V → ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))

Proof of Theorem bnj941
StepHypRef Expression
1 bnj941.1 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
2 opeq2 4769 . . . . . . 7 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → ⟨𝑛, 𝐶⟩ = ⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩)
32sneqd 4540 . . . . . 6 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → {⟨𝑛, 𝐶⟩} = {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩})
43uneq2d 4093 . . . . 5 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → (𝑓 ∪ {⟨𝑛, 𝐶⟩}) = (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}))
51, 4syl5eq 2845 . . . 4 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → 𝐺 = (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}))
65fneq1d 6424 . . 3 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → (𝐺 Fn 𝑝 ↔ (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}) Fn 𝑝))
76imbi2d 344 . 2 (𝐶 = if(𝐶 ∈ V, 𝐶, ∅) → (((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝) ↔ ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}) Fn 𝑝)))
8 eqid 2798 . . 3 (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}) = (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩})
9 0ex 5179 . . . 4 ∅ ∈ V
109elimel 4495 . . 3 if(𝐶 ∈ V, 𝐶, ∅) ∈ V
118, 10bnj927 32216 . 2 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → (𝑓 ∪ {⟨𝑛, if(𝐶 ∈ V, 𝐶, ∅)⟩}) Fn 𝑝)
127, 11dedth 4484 1 (𝐶 ∈ V → ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  Vcvv 3442   ∪ cun 3881  ∅c0 4246  ifcif 4428  {csn 4528  ⟨cop 4534  suc csuc 6168   Fn wfn 6327 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5171  ax-nul 5178  ax-pr 5299  ax-reg 9058 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3444  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-br 5035  df-opab 5097  df-id 5429  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-suc 6172  df-fun 6334  df-fn 6335 This theorem is referenced by:  bnj945  32221  bnj910  32396
 Copyright terms: Public domain W3C validator