Theorem wfrlem5OLD 8316

Description: Lemma for well-ordered recursion. The values of two acceptable functions agree within their domains. Obsolete as of 18-Nov-2024. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 21-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)

Hypotheses

Ref	Expression
wfrlem5OLD.1	⊢ 𝑅 We 𝐴
wfrlem5OLD.2	⊢ 𝑅 Se 𝐴
wfrlem5OLD.3	⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}

Assertion

Ref	Expression
wfrlem5OLD	⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑢 = 𝑣))

Distinct variable groups:   𝐴,𝑓,𝑔,ℎ,𝑥,𝑦   𝑓,𝐹,𝑔,ℎ,𝑥,𝑦   𝑅,𝑓,𝑔,ℎ,𝑥,𝑦   𝑢,𝑔,𝑣,ℎ,𝑥

Allowed substitution hints:   𝐴(𝑣,𝑢)   𝐵(𝑥,𝑦,𝑣,𝑢,𝑓,𝑔,ℎ)   𝑅(𝑣,𝑢)   𝐹(𝑣,𝑢)

Proof of Theorem wfrlem5OLD

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3477	. . . . . 6 ⊢ 𝑥 ∈ V
2		vex 3477	. . . . . 6 ⊢ 𝑢 ∈ V
3	1, 2	breldm 5909	. . . . 5 ⊢ (𝑥𝑔𝑢 → 𝑥 ∈ dom 𝑔)
4		vex 3477	. . . . . 6 ⊢ 𝑣 ∈ V
5	1, 4	breldm 5909	. . . . 5 ⊢ (𝑥ℎ𝑣 → 𝑥 ∈ dom ℎ)
6	3, 5	anim12i 612	. . . 4 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → (𝑥 ∈ dom 𝑔 ∧ 𝑥 ∈ dom ℎ))
7		elin 3965	. . . 4 ⊢ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ↔ (𝑥 ∈ dom 𝑔 ∧ 𝑥 ∈ dom ℎ))
8	6, 7	sylibr 233	. . 3 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑥 ∈ (dom 𝑔 ∩ dom ℎ))
9		anandi 673	. . . 4 ⊢ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ (𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣)) ↔ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢) ∧ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣)))
10	2	brresi 5991	. . . . 5 ⊢ (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ↔ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢))
11	4	brresi 5991	. . . . 5 ⊢ (𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣 ↔ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣))
12	10, 11	anbi12i 626	. . . 4 ⊢ ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣) ↔ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢) ∧ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣)))
13	9, 12	sylbb2 237	. . 3 ⊢ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ (𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣)) → (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
14	8, 13	mpancom 685	. 2 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
15		wfrlem5OLD.3	. . . . . . . . 9 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
16	15	wfrlem3OLD 8313	. . . . . . . 8 ⊢ (𝑔 ∈ 𝐵 → dom 𝑔 ⊆ 𝐴)
17		ssinss1 4238	. . . . . . . 8 ⊢ (dom 𝑔 ⊆ 𝐴 → (dom 𝑔 ∩ dom ℎ) ⊆ 𝐴)
18		wfrlem5OLD.1	. . . . . . . . . 10 ⊢ 𝑅 We 𝐴
19		wess 5664	. . . . . . . . . 10 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → (𝑅 We 𝐴 → 𝑅 We (dom 𝑔 ∩ dom ℎ)))
20	18, 19	mpi 20	. . . . . . . . 9 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → 𝑅 We (dom 𝑔 ∩ dom ℎ))
21		wfrlem5OLD.2	. . . . . . . . . 10 ⊢ 𝑅 Se 𝐴
22		sess2 5646	. . . . . . . . . 10 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → (𝑅 Se 𝐴 → 𝑅 Se (dom 𝑔 ∩ dom ℎ)))
23	21, 22	mpi 20	. . . . . . . . 9 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → 𝑅 Se (dom 𝑔 ∩ dom ℎ))
24	20, 23	jca 511	. . . . . . . 8 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → (𝑅 We (dom 𝑔 ∩ dom ℎ) ∧ 𝑅 Se (dom 𝑔 ∩ dom ℎ)))
25	16, 17, 24	3syl 18	. . . . . . 7 ⊢ (𝑔 ∈ 𝐵 → (𝑅 We (dom 𝑔 ∩ dom ℎ) ∧ 𝑅 Se (dom 𝑔 ∩ dom ℎ)))
26	25	adantr 480	. . . . . 6 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → (𝑅 We (dom 𝑔 ∩ dom ℎ) ∧ 𝑅 Se (dom 𝑔 ∩ dom ℎ)))
27	15	wfrlem4OLD 8315	. . . . . 6 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((𝑔 ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
28	15	wfrlem4OLD 8315	. . . . . . . 8 ⊢ ((ℎ ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔) ∧ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))))
29	28	ancoms 458	. . . . . . 7 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔) ∧ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))))
30		incom 4202	. . . . . . . . . . 11 ⊢ (dom 𝑔 ∩ dom ℎ) = (dom ℎ ∩ dom 𝑔)
31	30	reseq2i 5979	. . . . . . . . . 10 ⊢ (ℎ ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom ℎ ∩ dom 𝑔))
32	31	fneq1i 6647	. . . . . . . . 9 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ↔ (ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom 𝑔 ∩ dom ℎ))
33	30	fneq2i 6648	. . . . . . . . 9 ⊢ ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom 𝑔 ∩ dom ℎ) ↔ (ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔))
34	32, 33	bitri 274	. . . . . . . 8 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ↔ (ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔))
35	31	fveq1i 6893	. . . . . . . . . 10 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = ((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎)
36		predeq2 6304	. . . . . . . . . . . . 13 ⊢ ((dom 𝑔 ∩ dom ℎ) = (dom ℎ ∩ dom 𝑔) → Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎) = Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))
37	30, 36	ax-mp 5	. . . . . . . . . . . 12 ⊢ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎) = Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)
38	31, 37	reseq12i 5980	. . . . . . . . . . 11 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)) = ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))
39	38	fveq2i 6895	. . . . . . . . . 10 ⊢ (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))
40	35, 39	eqeq12i 2749	. . . . . . . . 9 ⊢ (((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) ↔ ((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))))
41	30, 40	raleqbii 3337	. . . . . . . 8 ⊢ (∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) ↔ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))))
42	34, 41	anbi12i 626	. . . . . . 7 ⊢ (((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))) ↔ ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔) ∧ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝐹‘((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))))
43	29, 42	sylibr 233	. . . . . 6 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
44		wfr3g 8310	. . . . . 6 ⊢ (((𝑅 We (dom 𝑔 ∩ dom ℎ) ∧ 𝑅 Se (dom 𝑔 ∩ dom ℎ)) ∧ ((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((𝑔 ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))) ∧ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝐹‘((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))))) → (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ)))
45	26, 27, 43, 44	syl3anc 1370	. . . . 5 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ)))
46	45	breqd 5160	. . . 4 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣 ↔ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
47	46	biimprd 247	. . 3 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → (𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣 → 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
48	15	wfrlem2OLD 8312	. . . . 5 ⊢ (𝑔 ∈ 𝐵 → Fun 𝑔)
49		funres 6591	. . . . 5 ⊢ (Fun 𝑔 → Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)))
50		dffun2 6554	. . . . . 6 ⊢ (Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↔ (Rel (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ∧ ∀𝑥∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣)))
51	50	simprbi 496	. . . . 5 ⊢ (Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) → ∀𝑥∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
52		2sp 2178	. . . . . 6 ⊢ (∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
53	52	sps 2177	. . . . 5 ⊢ (∀𝑥∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
54	48, 49, 51, 53	4syl 19	. . . 4 ⊢ (𝑔 ∈ 𝐵 → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
55	54	adantr 480	. . 3 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
56	47, 55	sylan2d 604	. 2 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
57	14, 56	syl5 34	1 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑢 = 𝑣))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540  ∃wex 1780   ∈ wcel 2105  {cab 2708  ∀wral 3060   ∩ cin 3948   ⊆ wss 3949   class class class wbr 5149   Se wse 5630   We wwe 5631  dom cdm 5677   ↾ cres 5679  Rel wrel 5682  Predcpred 6300  Fun wfun 6538   Fn wfn 6539  ‘cfv 6544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-po 5589  df-so 5590  df-fr 5632  df-se 5633  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-iota 6496  df-fun 6546  df-fn 6547  df-fv 6552

This theorem is referenced by:  wfrfunOLD  8322