Theorem frr3g 9790

Description: Functions defined by well-founded recursion are identical up to relation, domain, and characteristic function. General version of frr3 9795. (Contributed by Scott Fenton, 10-Feb-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)

Assertion

Ref	Expression
frr3g	⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → 𝐹 = 𝐺)

Distinct variable groups:   𝑦,𝐴   𝑦,𝐹   𝑦,𝐺   𝑦,𝐻   𝑦,𝑅

Proof of Theorem frr3g

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

Step	Hyp	Ref	Expression
1		ra4v 3878	. . . . . . . . . . 11 ⊢ (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
2		r19.26 3101	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))))
3	2	anbi2i 621	. . . . . . . . . . . . 13 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) ↔ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))))
4		fveq2 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
5		id 22	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → 𝑦 = 𝑧)
6		predeq3 6307	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
7	6	reseq2d 5980	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))
8	5, 7	oveq12d 7432	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
9	4, 8	eqeq12d 2742	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))))
10		fveq2 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐺‘𝑦) = (𝐺‘𝑧))
11	6	reseq2d 5980	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → (𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
12	5, 11	oveq12d 7432	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
13	10, 12	eqeq12d 2742	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → ((𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
14	9, 13	anbi12d 630	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑧 → (((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))))
15	14	rspcva 3606	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
16		eqtr3 2752	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐹‘𝑧))
17	16	eqcomd 2732	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
18		eqtr3 2752	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧))
19	18	ex 411	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → ((𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
20	17, 19	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
21	20	expimpd 452	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) → (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
22		predss 6311	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴
23		fvreseq 7043	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
24	22, 23	mpan2 689	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
25	24	biimpar 476	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
26	25	oveq2d 7430	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
27	26	eqcomd 2732	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
28	21, 27	syl11 33	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹‘𝑧) = (𝐺‘𝑧)))
29	28	expd 414	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
30	15, 29	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
31	30	ex 411	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
32	31	com23 86	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐴 → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
33	32	impd 409	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
34	3, 33	biimtrrid 242	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
35	34	a2d 29	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝐴 → ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
36	1, 35	syl5 34	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝐴 → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
37		fveq2 6891	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
38		fveq2 6891	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐺‘𝑧) = (𝐺‘𝑤))
39	37, 38	eqeq12d 2742	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑤) = (𝐺‘𝑤)))
40	39	imbi2d 339	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)) ↔ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤))))
41	36, 40	frins2 9788	. . . . . . . . 9 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
42		rsp 3235	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐴 (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)) → (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
43	41, 42	syl 17	. . . . . . . 8 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
44	43	com3r 87	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧))))
45	44	an4s 658	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧))))
46	45	com12 32	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧))))
47	46	3impib 1113	. . . 4 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧)))
48	47	ralrimiv 3135	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))
49		eqid 2726	. . 3 ⊢ 𝐴 = 𝐴
50	48, 49	jctil 518	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
51		eqfnfv2 7035	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
52	51	ad2ant2r 745	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
53	52	3adant1 1127	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
54	50, 53	mpbird 256	1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → 𝐹 = 𝐺)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1534   ∈ wcel 2099  ∀wral 3051   ⊆ wss 3947   Fr wfr 5625   Se wse 5626   ↾ cres 5675  Predcpred 6302   Fn wfn 6539  ‘cfv 6544  (class class class)co 7414

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pr 5424  ax-un 7736  ax-inf2 9675

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-rmo 3365  df-reu 3366  df-rab 3421  df-v 3465  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3967  df-nul 4324  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4907  df-int 4948  df-iun 4996  df-br 5145  df-opab 5207  df-mpt 5228  df-tr 5262  df-id 5571  df-eprel 5577  df-po 5585  df-so 5586  df-fr 5628  df-se 5629  df-we 5630  df-xp 5679  df-rel 5680  df-cnv 5681  df-co 5682  df-dm 5683  df-rn 5684  df-res 5685  df-ima 5686  df-pred 6303  df-ord 6369  df-on 6370  df-lim 6371  df-suc 6372  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-riota 7370  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7867  df-2nd 7994  df-frecs 8286  df-wrecs 8317  df-recs 8391  df-rdg 8430  df-1o 8486  df-oadd 8490  df-ttrcl 9742

This theorem is referenced by:  frrlem15  9791  frr3  9795