Theorem nninffeq 14053

Description: Equality of two functions on ℕ_∞ which agree at every integer and at the point at infinity. From an online post by Martin Escardo. Remark: the last two hypotheses can be grouped into one, ⊢ (𝜑 → ∀𝑛 ∈ suc ω...). (Contributed by Jim Kingdon, 4-Aug-2023.)

Hypotheses

Ref	Expression
nninffeq.f	⊢ (𝜑 → 𝐹:ℕ∞⟶ℕ0)
nninffeq.g	⊢ (𝜑 → 𝐺:ℕ∞⟶ℕ0)
nninffeq.oo	⊢ (𝜑 → (𝐹‘(𝑥 ∈ ω ↦ 1o)) = (𝐺‘(𝑥 ∈ ω ↦ 1o)))
nninffeq.n	⊢ (𝜑 → ∀𝑛 ∈ ω (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))))

Assertion

Ref	Expression
nninffeq	⊢ (𝜑 → 𝐹 = 𝐺)

Distinct variable groups:   𝑖,𝐹,𝑛,𝑥   𝑖,𝐺,𝑛,𝑥   𝜑,𝑖,𝑛,𝑥

Proof of Theorem nninffeq

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nninffeq.f	. . 3 ⊢ (𝜑 → 𝐹:ℕ∞⟶ℕ0)
2	1	ffnd 5348	. 2 ⊢ (𝜑 → 𝐹 Fn ℕ∞)
3		nninffeq.g	. . 3 ⊢ (𝜑 → 𝐺:ℕ∞⟶ℕ0)
4	3	ffnd 5348	. 2 ⊢ (𝜑 → 𝐺 Fn ℕ∞)
5		eqid 2170	. . . . . . . 8 ⊢ (𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅)) = (𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))
6		fveq2 5496	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
7		fveq2 5496	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝐺‘𝑥) = (𝐺‘𝑧))
8	6, 7	eqeq12d 2185	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝑧) = (𝐺‘𝑧)))
9	8	ifbid 3547	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅) = if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅))
10		simpr 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → 𝑧 ∈ ℕ∞)
11		1onn 6499	. . . . . . . . . 10 ⊢ 1o ∈ ω
12	11	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → 1o ∈ ω)
13		peano1 4578	. . . . . . . . . 10 ⊢ ∅ ∈ ω
14	13	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → ∅ ∈ ω)
15	1	ffvelrnda 5631	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → (𝐹‘𝑧) ∈ ℕ0)
16	15	nn0zd 9332	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → (𝐹‘𝑧) ∈ ℤ)
17	3	ffvelrnda 5631	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → (𝐺‘𝑧) ∈ ℕ0)
18	17	nn0zd 9332	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → (𝐺‘𝑧) ∈ ℤ)
19		zdceq 9287	. . . . . . . . . 10 ⊢ (((𝐹‘𝑧) ∈ ℤ ∧ (𝐺‘𝑧) ∈ ℤ) → DECID (𝐹‘𝑧) = (𝐺‘𝑧))
20	16, 18, 19	syl2anc 409	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → DECID (𝐹‘𝑧) = (𝐺‘𝑧))
21	12, 14, 20	ifcldcd 3561	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅) ∈ ω)
22	5, 9, 10, 21	fvmptd3 5589	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘𝑧) = if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅))
23		1lt2o 6421	. . . . . . . . . . . . 13 ⊢ 1o ∈ 2o
24	23	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → 1o ∈ 2o)
25		0lt2o 6420	. . . . . . . . . . . . 13 ⊢ ∅ ∈ 2o
26	25	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → ∅ ∈ 2o)
27	1	ffvelrnda 5631	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → (𝐹‘𝑥) ∈ ℕ0)
28	27	nn0zd 9332	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → (𝐹‘𝑥) ∈ ℤ)
29	3	ffvelrnda 5631	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → (𝐺‘𝑥) ∈ ℕ0)
30	29	nn0zd 9332	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → (𝐺‘𝑥) ∈ ℤ)
31		zdceq 9287	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑥) ∈ ℤ ∧ (𝐺‘𝑥) ∈ ℤ) → DECID (𝐹‘𝑥) = (𝐺‘𝑥))
32	28, 30, 31	syl2anc 409	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → DECID (𝐹‘𝑥) = (𝐺‘𝑥))
33	24, 26, 32	ifcldcd 3561	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℕ∞) → if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅) ∈ 2o)
34	33	fmpttd 5651	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅)):ℕ∞⟶2o)
35		2onn 6500	. . . . . . . . . . . 12 ⊢ 2o ∈ ω
36	35	elexi 2742	. . . . . . . . . . 11 ⊢ 2o ∈ V
37		nninfex 7098	. . . . . . . . . . 11 ⊢ ℕ∞ ∈ V
38	36, 37	elmap 6655	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅)) ∈ (2o ↑𝑚 ℕ∞) ↔ (𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅)):ℕ∞⟶2o)
39	34, 38	sylibr 133	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅)) ∈ (2o ↑𝑚 ℕ∞))
40		fveq2 5496	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑤 ∈ ω ↦ 1o) → (𝐹‘𝑥) = (𝐹‘(𝑤 ∈ ω ↦ 1o)))
41		fveq2 5496	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑤 ∈ ω ↦ 1o) → (𝐺‘𝑥) = (𝐺‘(𝑤 ∈ ω ↦ 1o)))
42	40, 41	eqeq12d 2185	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑤 ∈ ω ↦ 1o) → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o))))
43	42	ifbid 3547	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑤 ∈ ω ↦ 1o) → if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅) = if((𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o)), 1o, ∅))
44		infnninf 7100	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ ω ↦ 1o) ∈ ℕ∞
45	44	a1i 9	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑤 ∈ ω ↦ 1o) ∈ ℕ∞)
46		nninffeq.oo	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹‘(𝑥 ∈ ω ↦ 1o)) = (𝐺‘(𝑥 ∈ ω ↦ 1o)))
47		eqidd 2171	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑤 → 1o = 1o)
48	47	cbvmptv 4085	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ω ↦ 1o) = (𝑤 ∈ ω ↦ 1o)
49	48	fveq2i 5499	. . . . . . . . . . . . . 14 ⊢ (𝐹‘(𝑥 ∈ ω ↦ 1o)) = (𝐹‘(𝑤 ∈ ω ↦ 1o))
50	48	fveq2i 5499	. . . . . . . . . . . . . 14 ⊢ (𝐺‘(𝑥 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o))
51	46, 49, 50	3eqtr3g 2226	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o)))
52	51	iftrued 3533	. . . . . . . . . . . 12 ⊢ (𝜑 → if((𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o)), 1o, ∅) = 1o)
53	52, 11	eqeltrdi 2261	. . . . . . . . . . 11 ⊢ (𝜑 → if((𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o)), 1o, ∅) ∈ ω)
54	5, 43, 45, 53	fvmptd3 5589	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑤 ∈ ω ↦ 1o)) = if((𝐹‘(𝑤 ∈ ω ↦ 1o)) = (𝐺‘(𝑤 ∈ ω ↦ 1o)), 1o, ∅))
55	54, 52	eqtrd 2203	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑤 ∈ ω ↦ 1o)) = 1o)
56		nninffeq.n	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ ω (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))))
57		fveq2 5496	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) → (𝐹‘𝑥) = (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))))
58		fveq2 5496	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) → (𝐺‘𝑥) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))))
59	57, 58	eqeq12d 2185	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))))
60	59	ifbid 3547	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) → if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅) = if((𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))), 1o, ∅))
61		nnnninf 7102	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ω → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ ℕ∞)
62	61	ad2antlr 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → (𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)) ∈ ℕ∞)
63		simpr 109	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))))
64	63	iftrued 3533	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → if((𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))), 1o, ∅) = 1o)
65	64, 11	eqeltrdi 2261	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → if((𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))), 1o, ∅) ∈ ω)
66	5, 60, 62, 65	fvmptd3 5589	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = if((𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))), 1o, ∅))
67	66, 64	eqtrd 2203	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅)))) → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o)
68	67	ex 114	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o))
69	68	ralimdva 2537	. . . . . . . . . 10 ⊢ (𝜑 → (∀𝑛 ∈ ω (𝐹‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = (𝐺‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) → ∀𝑛 ∈ ω ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o))
70	56, 69	mpd 13	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ω ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o)
71	39, 55, 70	nninfall 14042	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ ℕ∞ ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘𝑧) = 1o)
72	71	r19.21bi 2558	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → ((𝑥 ∈ ℕ∞ ↦ if((𝐹‘𝑥) = (𝐺‘𝑥), 1o, ∅))‘𝑧) = 1o)
73	22, 72	eqtr3d 2205	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅) = 1o)
74	73	adantr 274	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℕ∞) ∧ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)) → if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅) = 1o)
75		simpr 109	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℕ∞) ∧ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)) → ¬ (𝐹‘𝑧) = (𝐺‘𝑧))
76	75	iffalsed 3536	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℕ∞) ∧ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)) → if((𝐹‘𝑧) = (𝐺‘𝑧), 1o, ∅) = ∅)
77	74, 76	eqtr3d 2205	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℕ∞) ∧ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)) → 1o = ∅)
78		1n0 6411	. . . . . 6 ⊢ 1o ≠ ∅
79	78	neii 2342	. . . . 5 ⊢ ¬ 1o = ∅
80	79	a1i 9	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ ℕ∞) ∧ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)) → ¬ 1o = ∅)
81	77, 80	pm2.65da 656	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → ¬ ¬ (𝐹‘𝑧) = (𝐺‘𝑧))
82		exmiddc 831	. . . 4 ⊢ (DECID (𝐹‘𝑧) = (𝐺‘𝑧) → ((𝐹‘𝑧) = (𝐺‘𝑧) ∨ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)))
83	20, 82	syl 14	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → ((𝐹‘𝑧) = (𝐺‘𝑧) ∨ ¬ (𝐹‘𝑧) = (𝐺‘𝑧)))
84	81, 83	ecased 1344	. 2 ⊢ ((𝜑 ∧ 𝑧 ∈ ℕ∞) → (𝐹‘𝑧) = (𝐺‘𝑧))
85	2, 4, 84	eqfnfvd 5596	1 ⊢ (𝜑 → 𝐹 = 𝐺)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ∨ wo 703  DECID wdc 829   = wceq 1348   ∈ wcel 2141  ∀wral 2448  ∅c0 3414  ifcif 3526   ↦ cmpt 4050  ωcom 4574  ⟶wf 5194  ‘cfv 5198  (class class class)co 5853  1_oc1o 6388  2_oc2o 6389   ↑_𝑚 cmap 6626  ℕ_∞xnninf 7096  ℕ₀cn0 9135  ℤcz 9212

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-ltadd 7890

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1o 6395  df-2o 6396  df-map 6628  df-nninf 7097  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213

This theorem is referenced by: (None)