Theorem fmptsng 6924

Description: Express a singleton function in maps-to notation. Version of fmptsn 6923 allowing the value 𝐵 to depend on the variable 𝑥. (Contributed by AV, 27-Feb-2019.)

Hypothesis

Ref	Expression
fmptsng.1	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)

Assertion

Ref	Expression
fmptsng	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem fmptsng

Dummy variables 𝑝 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		velsn 4576	. . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
2	1	bicomi 226	. . . 4 ⊢ (𝑥 = 𝐴 ↔ 𝑥 ∈ {𝐴})
3	2	anbi1i 625	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵))
4	3	opabbii 5125	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
5		velsn 4576	. . . . 5 ⊢ (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 = ⟨𝐴, 𝐶⟩)
6		eqidd 2822	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → 𝐴 = 𝐴)
7		eqidd 2822	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → 𝐶 = 𝐶)
8		eqeq1 2825	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
9	8	adantr 483	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐶) → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
10		eqeq1 2825	. . . . . . . . . 10 ⊢ (𝑦 = 𝐶 → (𝑦 = 𝐵 ↔ 𝐶 = 𝐵))
11		fmptsng.1	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
12	11	eqeq2d 2832	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝐶 = 𝐵 ↔ 𝐶 = 𝐶))
13	10, 12	sylan9bbr 513	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐶) → (𝑦 = 𝐵 ↔ 𝐶 = 𝐶))
14	9, 13	anbi12d 632	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐶) → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝐴 = 𝐴 ∧ 𝐶 = 𝐶)))
15	14	opelopabga 5412	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ (𝐴 = 𝐴 ∧ 𝐶 = 𝐶)))
16	6, 7, 15	mpbir2and 711	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)})
17		eleq1 2900	. . . . . 6 ⊢ (𝑝 = ⟨𝐴, 𝐶⟩ → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
18	16, 17	syl5ibrcom 249	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑝 = ⟨𝐴, 𝐶⟩ → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
19	5, 18	syl5bi 244	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑝 ∈ {⟨𝐴, 𝐶⟩} → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
20		elopab 5406	. . . . 5 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ ∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)))
21		opeq12 4798	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
22	21	eqeq2d 2832	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑝 = ⟨𝑥, 𝑦⟩ ↔ 𝑝 = ⟨𝐴, 𝐵⟩))
23	11	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐵 = 𝐶)
24	23	opeq2d 4803	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ⟨𝐴, 𝐵⟩ = ⟨𝐴, 𝐶⟩)
25		opex 5348	. . . . . . . . . . . 12 ⊢ ⟨𝐴, 𝐶⟩ ∈ V
26	25	snid 4594	. . . . . . . . . . 11 ⊢ ⟨𝐴, 𝐶⟩ ∈ {⟨𝐴, 𝐶⟩}
27	24, 26	eqeltrdi 2921	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩})
28		eleq1 2900	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝐴, 𝐵⟩ → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩}))
29	27, 28	syl5ibrcom 249	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑝 = ⟨𝐴, 𝐵⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
30	22, 29	sylbid 242	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑝 = ⟨𝑥, 𝑦⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
31	30	impcom 410	. . . . . . 7 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩})
32	31	exlimivv 1929	. . . . . 6 ⊢ (∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩})
33	32	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
34	20, 33	syl5bi 244	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
35	19, 34	impbid 214	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
36	35	eqrdv 2819	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → {⟨𝐴, 𝐶⟩} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)})
37		df-mpt 5139	. . 3 ⊢ (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
38	37	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)})
39	4, 36, 38	3eqtr4a 2882	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533  ∃wex 1776   ∈ wcel 2110  {csn 4560  ⟨cop 4566  {copab 5120   ↦ cmpt 5138

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 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-opab 5121  df-mpt 5139

This theorem is referenced by:  mdet0pr  21195  m1detdiag  21200