Theorem fnunop 6601

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 6537	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊) → {⟨𝑋, 𝑌⟩} Fn {𝑋})
5	2, 3, 4	syl2anc 590	. . 3 ⊢ (𝜑 → {⟨𝑋, 𝑌⟩} Fn {𝑋})
6		fnunop.d	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝐷)
7		disjsn 4643	. . . 4 ⊢ ((𝐷 ∩ {𝑋}) = ∅ ↔ ¬ 𝑋 ∈ 𝐷)
8	6, 7	sylibr 235	. . 3 ⊢ (𝜑 → (𝐷 ∩ {𝑋}) = ∅)
9	1, 5, 8	fnund 6600	. 2 ⊢ (𝜑 → (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
10		fnunop.g	. . . 4 ⊢ 𝐺 = (𝐹 ∪ {⟨𝑋, 𝑌⟩})
11	10	fneq1i 6582	. . 3 ⊢ (𝐺 Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn 𝐸)
12		fnunop.e	. . . 4 ⊢ 𝐸 = (𝐷 ∪ {𝑋})
13	12	fneq2i 6583	. . 3 ⊢ ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
14	11, 13	bitri 276	. 2 ⊢ (𝐺 Fn 𝐸 ↔ (𝐹 ∪ {⟨𝑋, 𝑌⟩}) Fn (𝐷 ∪ {𝑋}))
15	9, 14	sylibr 235	1 ⊢ (𝜑 → 𝐺 Fn 𝐸)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1547   ∈ wcel 2119   ∪ cun 3881   ∩ cin 3882  ∅c0 4261  {csn 4555  ⟨cop 4561   Fn wfn 6480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-mo 2543  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-fun 6487  df-fn 6488

This theorem is referenced by:  fineqvac  35297