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

Theorem fsnunf 7205
Description: Adjoining a point to a function gives a function. (Contributed by Stefan O'Rear, 28-Feb-2015.)
Assertion
Ref Expression
fsnunf ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → (𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶𝑇)

Proof of Theorem fsnunf
StepHypRef Expression
1 simp1 1135 . . 3 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → 𝐹:𝑆𝑇)
2 simp2l 1198 . . . . 5 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → 𝑋𝑉)
3 simp3 1137 . . . . 5 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → 𝑌𝑇)
4 f1osng 6890 . . . . 5 ((𝑋𝑉𝑌𝑇) → {⟨𝑋, 𝑌⟩}:{𝑋}–1-1-onto→{𝑌})
52, 3, 4syl2anc 584 . . . 4 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → {⟨𝑋, 𝑌⟩}:{𝑋}–1-1-onto→{𝑌})
6 f1of 6849 . . . 4 ({⟨𝑋, 𝑌⟩}:{𝑋}–1-1-onto→{𝑌} → {⟨𝑋, 𝑌⟩}:{𝑋}⟶{𝑌})
75, 6syl 17 . . 3 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → {⟨𝑋, 𝑌⟩}:{𝑋}⟶{𝑌})
8 simp2r 1199 . . . 4 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → ¬ 𝑋𝑆)
9 disjsn 4716 . . . 4 ((𝑆 ∩ {𝑋}) = ∅ ↔ ¬ 𝑋𝑆)
108, 9sylibr 234 . . 3 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → (𝑆 ∩ {𝑋}) = ∅)
11 fun 6771 . . 3 (((𝐹:𝑆𝑇 ∧ {⟨𝑋, 𝑌⟩}:{𝑋}⟶{𝑌}) ∧ (𝑆 ∩ {𝑋}) = ∅) → (𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶(𝑇 ∪ {𝑌}))
121, 7, 10, 11syl21anc 838 . 2 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → (𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶(𝑇 ∪ {𝑌}))
13 snssi 4813 . . . . 5 (𝑌𝑇 → {𝑌} ⊆ 𝑇)
14133ad2ant3 1134 . . . 4 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → {𝑌} ⊆ 𝑇)
15 ssequn2 4199 . . . 4 ({𝑌} ⊆ 𝑇 ↔ (𝑇 ∪ {𝑌}) = 𝑇)
1614, 15sylib 218 . . 3 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → (𝑇 ∪ {𝑌}) = 𝑇)
1716feq3d 6724 . 2 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → ((𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶(𝑇 ∪ {𝑌}) ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶𝑇))
1812, 17mpbid 232 1 ((𝐹:𝑆𝑇 ∧ (𝑋𝑉 ∧ ¬ 𝑋𝑆) ∧ 𝑌𝑇) → (𝐹 ∪ {⟨𝑋, 𝑌⟩}):(𝑆 ∪ {𝑋})⟶𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  cun 3961  cin 3962  wss 3963  c0 4339  {csn 4631  cop 4637  wf 6559  1-1-ontowf1o 6562
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570
This theorem is referenced by:  fsnunf2  7206  f1ounsn  7292  fnchoice  44967  nnsum4primeseven  47725  nnsum4primesevenALTV  47726
  Copyright terms: Public domain W3C validator