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

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

Proof of Theorem bnj927
StepHypRef Expression
1 simpr 484 . . . 4 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝑓 Fn 𝑛)
2 vex 3477 . . . . . 6 𝑛 ∈ V
3 bnj927.2 . . . . . 6 𝐶 ∈ V
42, 3fnsn 6606 . . . . 5 {⟨𝑛, 𝐶⟩} Fn {𝑛}
54a1i 11 . . . 4 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → {⟨𝑛, 𝐶⟩} Fn {𝑛})
6 disjcsn 9605 . . . . 5 (𝑛 ∩ {𝑛}) = ∅
76a1i 11 . . . 4 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → (𝑛 ∩ {𝑛}) = ∅)
81, 5, 7fnund 6664 . . 3 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → (𝑓 ∪ {⟨𝑛, 𝐶⟩}) Fn (𝑛 ∪ {𝑛}))
9 bnj927.1 . . . 4 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
109fneq1i 6646 . . 3 (𝐺 Fn (𝑛 ∪ {𝑛}) ↔ (𝑓 ∪ {⟨𝑛, 𝐶⟩}) Fn (𝑛 ∪ {𝑛}))
118, 10sylibr 233 . 2 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn (𝑛 ∪ {𝑛}))
12 df-suc 6370 . . . . . 6 suc 𝑛 = (𝑛 ∪ {𝑛})
1312eqeq2i 2744 . . . . 5 (𝑝 = suc 𝑛𝑝 = (𝑛 ∪ {𝑛}))
1413biimpi 215 . . . 4 (𝑝 = suc 𝑛𝑝 = (𝑛 ∪ {𝑛}))
1514adantr 480 . . 3 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝑝 = (𝑛 ∪ {𝑛}))
1615fneq2d 6643 . 2 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → (𝐺 Fn 𝑝𝐺 Fn (𝑛 ∪ {𝑛})))
1711, 16mpbird 257 1 ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2105  Vcvv 3473  cun 3946  cin 3947  c0 4322  {csn 4628  cop 4634  suc csuc 6366   Fn wfn 6538
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-reg 9593
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-suc 6370  df-fun 6545  df-fn 6546
This theorem is referenced by:  bnj941  34247  bnj929  34411
  Copyright terms: Public domain W3C validator