Theorem wfr3g 7413

Description: Functions defined by well-founded recursion are identical up to relation, domain, and characteristic function. (Contributed by Scott Fenton, 11-Feb-2011.)

Assertion

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

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

Proof of Theorem wfr3g

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

Step	Hyp	Ref	Expression
1		r19.26 3064	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))))
2		fveq2 6191	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
3		fveq2 6191	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐺‘𝑧) = (𝐺‘𝑤))
4	2, 3	eqeq12d 2637	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑤) = (𝐺‘𝑤)))
5	4	imbi2d 330	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)) ↔ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤))))
6		ra4v 3524	. . . . . . . . . . 11 ⊢ (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
7		fveq2 6191	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
8		predeq3 5684	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
9	8	reseq2d 5396	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))
10	9	fveq2d 6195	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
11	7, 10	eqeq12d 2637	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))))
12		fveq2 6191	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → (𝐺‘𝑦) = (𝐺‘𝑧))
13	8	reseq2d 5396	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑧 → (𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
14	13	fveq2d 6195	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑧 → (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
15	12, 14	eqeq12d 2637	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑧 → ((𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
16	11, 15	anbi12d 747	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑧 → (((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))))
17	16	rspcva 3307	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))))
18		eqtr3 2643	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
19	18	ancoms 469	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))))
20		eqtr3 2643	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧))
21	20	ex 450	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → ((𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
22	19, 21	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
23	22	expimpd 629	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) → (((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
24		predss 5687	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴
25		fvreseq 6319	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ Pred(𝑅, 𝐴, 𝑧) ⊆ 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
26	24, 25	mpan2 707	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) ↔ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)))
27	26	biimpar 502	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))
28	27	eqcomd 2628	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))
29	28	fveq2d 6195	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))))
30	23, 29	syl11 33	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (𝐹‘𝑧) = (𝐺‘𝑧)))
31	30	expd 452	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑧) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∧ (𝐺‘𝑧) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
32	17, 31	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
33	32	ex 450	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
34	33	com23 86	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝐴 → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦)))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧)))))
35	34	impd 447	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤) → (𝐹‘𝑧) = (𝐺‘𝑧))))
36	35	a2d 29	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝐴 → ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
37	6, 36	syl5 34	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝐴 → (∀𝑤 ∈ Pred (𝑅, 𝐴, 𝑧)(((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑤) = (𝐺‘𝑤)) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧))))
38	5, 37	wfis2g 5719	. . . . . . . . 9 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)))
39		r19.21v 2960	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐴 (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹‘𝑧) = (𝐺‘𝑧)) ↔ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
40	38, 39	sylib 208	. . . . . . . 8 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
41	40	com12 32	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
42	1, 41	sylan2br 493	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
43	42	an4s 869	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
44	43	com12 32	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
45	44	3impib 1262	. . 3 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))
46		eqid 2622	. . 3 ⊢ 𝐴 = 𝐴
47	45, 46	jctil 560	. 2 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
48		eqfnfv2 6312	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
49	48	ad2ant2r 783	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
50	49	3adant1 1079	. 2 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))))
51	47, 50	mpbird 247	1 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐻‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) = (𝐻‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑦))))) → 𝐹 = 𝐺)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ∀wral 2912   ⊆ wss 3574   Se wse 5071   We wwe 5072   ↾ cres 5116  Predcpred 5679   Fn wfn 5883  ‘cfv 5888

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896

This theorem is referenced by:  wfrlem5  7419  wfr3  7435