Theorem frr3g 9709

Description: Functions defined by well-founded recursion are identical up to relation, domain, and characteristic function. General version of frr3 9714. (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 3848	. . . . . . . . . . 11 ⊢ (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
2		r19.26 3091	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))))
3	2	anbi2i 623	. . . . . . . . . . . . 13 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) ↔ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))))
4		fveq2 6858	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
5		id 22	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → 𝑦 = 𝑧)
6		predeq3 6278	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
7	6	reseq2d 5950	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))
8	5, 7	oveq12d 7405	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
9	4, 8	eqeq12d 2745	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))))
10		fveq2 6858	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐺‘𝑦) = (𝐺‘𝑧))
11	6	reseq2d 5950	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → (𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
12	5, 11	oveq12d 7405	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
13	10, 12	eqeq12d 2745	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → ((𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
14	9, 13	anbi12d 632	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑧 → (((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))))
15	14	rspcva 3586	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
16		eqtr3 2751	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐹‘𝑧))
17	16	eqcomd 2735	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
18		eqtr3 2751	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧))
19	18	ex 412	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → ((𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
20	17, 19	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
21	20	expimpd 453	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) → (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
22		predss 6282	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴
23		fvreseq 7012	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
24	22, 23	mpan2 691	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
25	24	biimpar 477	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
26	25	oveq2d 7403	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
27	26	eqcomd 2735	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
28	21, 27	syl11 33	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹‘𝑧) = (𝐺‘𝑧)))
29	28	expd 415	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑧) = (𝑧𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝑧𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
30	15, 29	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
31	30	ex 412	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
32	31	com23 86	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐴 → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
33	32	impd 410	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
34	3, 33	biimtrrid 243	. . . . . . . . . . . 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 6858	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
38		fveq2 6858	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐺‘𝑧) = (𝐺‘𝑤))
39	37, 38	eqeq12d 2745	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑤) = (𝐺‘𝑤)))
40	39	imbi2d 340	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)) ↔ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤))))
41	36, 40	frins2 9707	. . . . . . . . 9 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
42		rsp 3225	. . . . . . . . 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 660	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧))))
46	45	com12 32	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧))))
47	46	3impib 1116	. . . 4 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝑧 ∈ 𝐴 → (𝐹‘𝑧) = (𝐺‘𝑧)))
48	47	ralrimiv 3124	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))
49		eqid 2729	. . 3 ⊢ 𝐴 = 𝐴
50	48, 49	jctil 519	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
51		eqfnfv2 7004	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
52	51	ad2ant2r 747	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
53	52	3adant1 1130	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
54	50, 53	mpbird 257	1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝑦𝐻(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝑦𝐻(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → 𝐹 = 𝐺)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044   ⊆ wss 3914   Fr wfr 5588   Se wse 5589   ↾ cres 5640  Predcpred 6273   Fn wfn 6506  ‘cfv 6511  (class class class)co 7387

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711  ax-inf2 9594

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-ttrcl 9661

This theorem is referenced by:  frrlem15  9710  frr3  9714