Theorem fnunop 6649

Description: Extension of a function with a new ordered pair. (Contributed by NM, 28-Sep-2013.) (Revised by Mario Carneiro, 30-Apr-2015.) (Revised by AV, 16-Aug-2024.)

Hypotheses

Ref	Expression
fnunop.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
fnunop.y	⊢ (𝜑 → 𝑌 ∈ 𝑊)
fnunop.f	⊢ (𝜑 → 𝐹 Fn 𝐷)
fnunop.g	⊢ 𝐺 = (𝐹 ∪ {⟨𝑋, 𝑌⟩})
fnunop.e	⊢ 𝐸 = (𝐷 ∪ {𝑋})
fnunop.d	⊢ (𝜑 → ¬ 𝑋 ∈ 𝐷)

Assertion

Ref	Expression
fnunop	⊢ (𝜑 → 𝐺 Fn 𝐸)

Proof of Theorem fnunop

Step	Hyp	Ref	Expression
1		fnunop.f	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐷)
2		fnunop.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
3		fnunop.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑊)
4		fnsng 6585	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → {⟨𝑋, 𝑌⟩} Fn {𝑋})
5	2, 3, 4	syl2anc 595	. . 3 ⊢ (𝜑 → {⟨𝑋, 𝑌⟩} Fn {𝑋})
6		fnunop.d	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝐷)
7		disjsn 4679	. . . 4 ⊢ ((𝐷 ∩ {𝑋}) = ∅ ↔ ¬ 𝑋 ∈ 𝐷)
8	6, 7	sylibr 237	. . 3 ⊢ (𝜑 → (𝐷 ∩ {𝑋}) = ∅)
9	1, 5, 8	fnund 6648	. 2 ⊢ (𝜑 → (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
10		fnunop.g	. . . 4 ⊢ 𝐺 = (𝐹 ∪ {⟨𝑋, 𝑌⟩})
11	10	fneq1i 6630	. . 3 ⊢ (𝐺 Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn 𝐸)
12		fnunop.e	. . . 4 ⊢ 𝐸 = (𝐷 ∪ {𝑋})
13	12	fneq2i 6631	. . 3 ⊢ ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
14	11, 13	bitri 278	. 2 ⊢ (𝐺 Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
15	9, 14	sylibr 237	1 ⊢ (𝜑 → 𝐺 Fn 𝐸)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1567   ∈ wcel 2149   ∪ cun 3911   ∩ cin 3912  ∅c0 4294  {csn 4591  ⟨cop 4597   Fn wfn 6528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-pr 5402

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-opab 5175  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-fun 6535  df-fn 6536

This theorem is referenced by:  fineqvac  35448