Theorem fsneq 45564

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 6985	. . 3 ⊢ ((𝐹 Fn 𝐵 ∧ 𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)))
4	1, 2, 3	syl2anc 585	. 2 ⊢ (𝜑 → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)))
5		fsneq.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		snidg 4619	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
7	5, 6	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
8		fsneq.b	. . . . . . . . 9 ⊢ 𝐵 = {𝐴}
9	8	eqcomi 2746	. . . . . . . 8 ⊢ {𝐴} = 𝐵
10	9	a1i 11	. . . . . . 7 ⊢ (𝜑 → {𝐴} = 𝐵)
11	7, 10	eleqtrd 2839	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → 𝐴 ∈ 𝐵)
13		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥))
14		fveq2 6842	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
15		fveq2 6842	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐺‘𝑥) = (𝐺‘𝐴))
16	14, 15	eqeq12d 2753	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝐴) = (𝐺‘𝐴)))
17	16	rspcva 3576	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝐹‘𝐴) = (𝐺‘𝐴))
18	12, 13, 17	syl2anc 585	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝐹‘𝐴) = (𝐺‘𝐴))
19	18	ex 412	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (𝐺‘𝑥) → (𝐹‘𝐴) = (𝐺‘𝐴)))
20		simpl 482	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝐴) = (𝐺‘𝐴))
21	8	eleq2i 2829	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ {𝐴})
22	21	biimpi 216	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ {𝐴})
23		velsn 4598	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
24	22, 23	sylib 218	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → 𝑥 = 𝐴)
25	24	fveq2d 6846	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐴))
26	25	adantl 481	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐹‘𝐴))
27	24	fveq2d 6846	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → (𝐺‘𝑥) = (𝐺‘𝐴))
28	27	adantl 481	. . . . . . 7 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝐴))
29	20, 26, 28	3eqtr4d 2782	. . . . . 6 ⊢ (((𝐹‘𝐴) = (𝐺‘𝐴) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐺‘𝑥))
30	29	adantll 715	. . . . 5 ⊢ (((𝜑 ∧ (𝐹‘𝐴) = (𝐺‘𝐴)) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (𝐺‘𝑥))
31	30	ralrimiva 3130	. . . 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 1542   ∈ wcel 2114  ∀wral 3052  {csn 4582   Fn wfn 6495  ‘cfv 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-fv 6508

This theorem is referenced by:  fsneqrn  45569  unirnmapsn  45572