Theorem fsneq 45149

Description: Equality condition for two functions defined on a singleton. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

Hypotheses

Ref	Expression
fsneq.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
fsneq.b	⊢ 𝐵 = {𝐴}
fsneq.f	⊢ (𝜑 → 𝐹 Fn 𝐵)
fsneq.g	⊢ (𝜑 → 𝐺 Fn 𝐵)

Assertion

Ref	Expression
fsneq	⊢ (𝜑 → (𝐹 = 𝐺 ↔ (𝐹‘𝐴) = (𝐺‘𝐴)))

Proof of Theorem fsneq

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsneq.f	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐵)
2		fsneq.g	. . 3 ⊢ (𝜑 → 𝐺 Fn 𝐵)
3		eqfnfv 7051	. . 3 ⊢ ((𝐹 Fn 𝐵 ∧ 𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)))
4	1, 2, 3	syl2anc 584	. 2 ⊢ (𝜑 → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)))
5		fsneq.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		snidg 4665	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
7	5, 6	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
8		fsneq.b	. . . . . . . . 9 ⊢ 𝐵 = {𝐴}
9	8	eqcomi 2744	. . . . . . . 8 ⊢ {𝐴} = 𝐵
10	9	a1i 11	. . . . . . 7 ⊢ (𝜑 → {𝐴} = 𝐵)
11	7, 10	eleqtrd 2841	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → 𝐴 ∈ 𝐵)
13		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥))
14		fveq2 6907	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
15		fveq2 6907	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐺‘𝑥) = (𝐺‘𝐴))
16	14, 15	eqeq12d 2751	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝐴) = (𝐺‘𝐴)))
17	16	rspcva 3620	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝐹‘𝐴) = (𝐺‘𝐴))
18	12, 13, 17	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝐹‘𝐴) = (𝐺‘𝐴))
19	18	ex 412	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥) → (𝐹‘𝐴) = (𝐺‘𝐴)))
20		simpl 482	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝐴) = (𝐺‘𝐴))
21	8	eleq2i 2831	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ {𝐴})
22	21	biimpi 216	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ {𝐴})
23		velsn 4647	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
24	22, 23	sylib 218	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → 𝑥 = 𝐴)
25	24	fveq2d 6911	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐴))
26	25	adantl 481	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐹‘𝐴))
27	24	fveq2d 6911	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → (𝐺‘𝑥) = (𝐺‘𝐴))
28	27	adantl 481	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝐴))
29	20, 26, 28	3eqtr4d 2785	. . . . . 6 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐺‘𝑥))
30	29	adantll 714	. . . . 5 ⊢ (((𝜑 ∧ (𝐹‘𝐴) = (𝐺‘𝐴)) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐺‘𝑥))
31	30	ralrimiva 3144	. . . 4 ⊢ ((𝜑 ∧ (𝐹‘𝐴) = (𝐺‘𝐴)) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥))
32	31	ex 412	. . 3 ⊢ (𝜑 → ((𝐹‘𝐴) = (𝐺‘𝐴) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)))
33	19, 32	impbid 212	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝐴) = (𝐺‘𝐴)))
34	4, 33	bitrd 279	1 ⊢ (𝜑 → (𝐹 = 𝐺 ↔ (𝐹‘𝐴) = (𝐺‘𝐴)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  {csn 4631   Fn wfn 6558  ‘cfv 6563

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-11 2155  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-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  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-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-fv 6571

This theorem is referenced by:  fsneqrn  45154  unirnmapsn  45157