Theorem tfrlem1 8432

Description: A technical lemma for transfinite recursion. Compare Lemma 1 of [TakeutiZaring] p. 47. (Contributed by NM, 23-Mar-1995.) (Revised by Mario Carneiro, 24-May-2019.)

Hypotheses

Ref	Expression
tfrlem1.1	⊢ (𝜑 → 𝐴 ∈ On)
tfrlem1.2	⊢ (𝜑 → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹))
tfrlem1.3	⊢ (𝜑 → (Fun 𝐺 ∧ 𝐴 ⊆ dom 𝐺))
tfrlem1.4	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐵‘(𝐹 ↾ 𝑥)))
tfrlem1.5	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) = (𝐵‘(𝐺 ↾ 𝑥)))

Assertion

Ref	Expression
tfrlem1	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝐺

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem tfrlem1

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

Step	Hyp	Ref	Expression
1		ssid 4031	. 2 ⊢ 𝐴 ⊆ 𝐴
2		tfrlem1.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ On)
3		sseq1 4034	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑦 ⊆ 𝐴 ↔ 𝑧 ⊆ 𝐴))
4		raleq 3331	. . . . . 6 ⊢ (𝑦 = 𝑧 → (∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥) ↔ ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)))
5	3, 4	imbi12d 344	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥)) ↔ (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))))
6	5	imbi2d 340	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝜑 → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥))) ↔ (𝜑 → (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)))))
7		sseq1 4034	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑦 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴))
8		raleq 3331	. . . . . 6 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
9	7, 8	imbi12d 344	. . . . 5 ⊢ (𝑦 = 𝐴 → ((𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥)) ↔ (𝐴 ⊆ 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))))
10	9	imbi2d 340	. . . 4 ⊢ (𝑦 = 𝐴 → ((𝜑 → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥))) ↔ (𝜑 → (𝐴 ⊆ 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))))
11		r19.21v 3186	. . . . 5 ⊢ (∀𝑧 ∈ 𝑦 (𝜑 → (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ↔ (𝜑 → ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))))
12		tfrlem1.2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹))
13	12	ad4antr 731	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹))
14	13	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → Fun 𝐹)
15	14	funfnd 6609	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝐹 Fn dom 𝐹)
16		eloni 6405	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ On → Ord 𝑦)
17	16	ad3antlr 730	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) → Ord 𝑦)
18		ordelss 6411	. . . . . . . . . . . . . . . . 17 ⊢ ((Ord 𝑦 ∧ 𝑤 ∈ 𝑦) → 𝑤 ⊆ 𝑦)
19	17, 18	sylan 579	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑤 ⊆ 𝑦)
20		simplr 768	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑦 ⊆ 𝐴)
21	19, 20	sstrd 4019	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑤 ⊆ 𝐴)
22	13	simprd 495	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝐴 ⊆ dom 𝐹)
23	21, 22	sstrd 4019	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑤 ⊆ dom 𝐹)
24		fnssres 6703	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑤 ⊆ dom 𝐹) → (𝐹 ↾ 𝑤) Fn 𝑤)
25	15, 23, 24	syl2anc 583	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐹 ↾ 𝑤) Fn 𝑤)
26		tfrlem1.3	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (Fun 𝐺 ∧ 𝐴 ⊆ dom 𝐺))
27	26	ad4antr 731	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (Fun 𝐺 ∧ 𝐴 ⊆ dom 𝐺))
28	27	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → Fun 𝐺)
29	28	funfnd 6609	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝐺 Fn dom 𝐺)
30	27	simprd 495	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝐴 ⊆ dom 𝐺)
31	21, 30	sstrd 4019	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑤 ⊆ dom 𝐺)
32		fnssres 6703	. . . . . . . . . . . . . 14 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑤 ⊆ dom 𝐺) → (𝐺 ↾ 𝑤) Fn 𝑤)
33	29, 31, 32	syl2anc 583	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐺 ↾ 𝑤) Fn 𝑤)
34		fveq2 6920	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑢 → (𝐹‘𝑥) = (𝐹‘𝑢))
35		fveq2 6920	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑢 → (𝐺‘𝑥) = (𝐺‘𝑢))
36	34, 35	eqeq12d 2756	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑢 → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝑢) = (𝐺‘𝑢)))
37	21	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → 𝑤 ⊆ 𝐴)
38		sseq1 4034	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = 𝑤 → (𝑧 ⊆ 𝐴 ↔ 𝑤 ⊆ 𝐴))
39		raleq 3331	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = 𝑤 → (∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥) ↔ ∀𝑥 ∈ 𝑤 (𝐹‘𝑥) = (𝐺‘𝑥)))
40	38, 39	imbi12d 344	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = 𝑤 → ((𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)) ↔ (𝑤 ⊆ 𝐴 → ∀𝑥 ∈ 𝑤 (𝐹‘𝑥) = (𝐺‘𝑥))))
41		simp-4r 783	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)))
42		simplr 768	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → 𝑤 ∈ 𝑦)
43	40, 41, 42	rspcdva 3636	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → (𝑤 ⊆ 𝐴 → ∀𝑥 ∈ 𝑤 (𝐹‘𝑥) = (𝐺‘𝑥)))
44	37, 43	mpd 15	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → ∀𝑥 ∈ 𝑤 (𝐹‘𝑥) = (𝐺‘𝑥))
45		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → 𝑢 ∈ 𝑤)
46	36, 44, 45	rspcdva 3636	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → (𝐹‘𝑢) = (𝐺‘𝑢))
47		fvres 6939	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ 𝑤 → ((𝐹 ↾ 𝑤)‘𝑢) = (𝐹‘𝑢))
48	47	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → ((𝐹 ↾ 𝑤)‘𝑢) = (𝐹‘𝑢))
49		fvres 6939	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ 𝑤 → ((𝐺 ↾ 𝑤)‘𝑢) = (𝐺‘𝑢))
50	49	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → ((𝐺 ↾ 𝑤)‘𝑢) = (𝐺‘𝑢))
51	46, 48, 50	3eqtr4d 2790	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) ∧ 𝑢 ∈ 𝑤) → ((𝐹 ↾ 𝑤)‘𝑢) = ((𝐺 ↾ 𝑤)‘𝑢))
52	25, 33, 51	eqfnfvd 7067	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐹 ↾ 𝑤) = (𝐺 ↾ 𝑤))
53	52	fveq2d 6924	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐵‘(𝐹 ↾ 𝑤)) = (𝐵‘(𝐺 ↾ 𝑤)))
54		fveq2 6920	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝐹‘𝑥) = (𝐹‘𝑤))
55		reseq2 6004	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (𝐹 ↾ 𝑥) = (𝐹 ↾ 𝑤))
56	55	fveq2d 6924	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝐵‘(𝐹 ↾ 𝑥)) = (𝐵‘(𝐹 ↾ 𝑤)))
57	54, 56	eqeq12d 2756	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ((𝐹‘𝑥) = (𝐵‘(𝐹 ↾ 𝑥)) ↔ (𝐹‘𝑤) = (𝐵‘(𝐹 ↾ 𝑤))))
58		tfrlem1.4	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐵‘(𝐹 ↾ 𝑥)))
59	58	ad4antr 731	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐵‘(𝐹 ↾ 𝑥)))
60		simpr 484	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) → 𝑦 ⊆ 𝐴)
61	60	sselda 4008	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → 𝑤 ∈ 𝐴)
62	57, 59, 61	rspcdva 3636	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐹‘𝑤) = (𝐵‘(𝐹 ↾ 𝑤)))
63		fveq2 6920	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝐺‘𝑥) = (𝐺‘𝑤))
64		reseq2 6004	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (𝐺 ↾ 𝑥) = (𝐺 ↾ 𝑤))
65	64	fveq2d 6924	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝐵‘(𝐺 ↾ 𝑥)) = (𝐵‘(𝐺 ↾ 𝑤)))
66	63, 65	eqeq12d 2756	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → ((𝐺‘𝑥) = (𝐵‘(𝐺 ↾ 𝑥)) ↔ (𝐺‘𝑤) = (𝐵‘(𝐺 ↾ 𝑤))))
67		tfrlem1.5	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) = (𝐵‘(𝐺 ↾ 𝑥)))
68	67	ad4antr 731	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) = (𝐵‘(𝐺 ↾ 𝑥)))
69	66, 68, 61	rspcdva 3636	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐺‘𝑤) = (𝐵‘(𝐺 ↾ 𝑤)))
70	53, 62, 69	3eqtr4d 2790	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) ∧ 𝑤 ∈ 𝑦) → (𝐹‘𝑤) = (𝐺‘𝑤))
71	70	ralrimiva 3152	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) → ∀𝑤 ∈ 𝑦 (𝐹‘𝑤) = (𝐺‘𝑤))
72	54, 63	eqeq12d 2756	. . . . . . . . . 10 ⊢ (𝑥 = 𝑤 → ((𝐹‘𝑥) = (𝐺‘𝑥) ↔ (𝐹‘𝑤) = (𝐺‘𝑤)))
73	72	cbvralvw 3243	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥) ↔ ∀𝑤 ∈ 𝑦 (𝐹‘𝑤) = (𝐺‘𝑤))
74	71, 73	sylibr 234	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ On) ∧ ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) ∧ 𝑦 ⊆ 𝐴) → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥))
75	74	exp31 419	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ On) → (∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥))))
76	75	expcom 413	. . . . . 6 ⊢ (𝑦 ∈ On → (𝜑 → (∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥)) → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥)))))
77	76	a2d 29	. . . . 5 ⊢ (𝑦 ∈ On → ((𝜑 → ∀𝑧 ∈ 𝑦 (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) → (𝜑 → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥)))))
78	11, 77	biimtrid 242	. . . 4 ⊢ (𝑦 ∈ On → (∀𝑧 ∈ 𝑦 (𝜑 → (𝑧 ⊆ 𝐴 → ∀𝑥 ∈ 𝑧 (𝐹‘𝑥) = (𝐺‘𝑥))) → (𝜑 → (𝑦 ⊆ 𝐴 → ∀𝑥 ∈ 𝑦 (𝐹‘𝑥) = (𝐺‘𝑥)))))
79	6, 10, 78	tfis3 7895	. . 3 ⊢ (𝐴 ∈ On → (𝜑 → (𝐴 ⊆ 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))))
80	2, 79	mpcom 38	. 2 ⊢ (𝜑 → (𝐴 ⊆ 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
81	1, 80	mpi 20	1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067   ⊆ wss 3976  dom cdm 5700   ↾ cres 5702  Ord word 6394  Oncon0 6395  Fun wfun 6567   Fn wfn 6568  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-fv 6581

This theorem is referenced by:  tfrlem5  8436