Theorem frrlem15 9686

Description: Lemma for general well-founded recursion. Two acceptable functions are compatible. (Contributed by Scott Fenton, 11-Sep-2023.)

Hypotheses

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

Assertion

Ref	Expression
frrlem15	⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑢 = 𝑣))

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

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

Proof of Theorem frrlem15

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3448	. . . . . 6 ⊢ 𝑥 ∈ V
2		vex 3448	. . . . . 6 ⊢ 𝑢 ∈ V
3	1, 2	breldm 5862	. . . . 5 ⊢ (𝑥𝑔𝑢 → 𝑥 ∈ dom 𝑔)
4	3	adantr 480	. . . 4 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑥 ∈ dom 𝑔)
5		vex 3448	. . . . . 6 ⊢ 𝑣 ∈ V
6	1, 5	breldm 5862	. . . . 5 ⊢ (𝑥ℎ𝑣 → 𝑥 ∈ dom ℎ)
7	6	adantl 481	. . . 4 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑥 ∈ dom ℎ)
8	4, 7	elind 4159	. . 3 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑥 ∈ (dom 𝑔 ∩ dom ℎ))
9		id 22	. . 3 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → (𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣))
10	2	brresi 5948	. . . . 5 ⊢ (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ↔ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢))
11	5	brresi 5948	. . . . 5 ⊢ (𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣 ↔ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣))
12	10, 11	anbi12i 628	. . . 4 ⊢ ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣) ↔ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢) ∧ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣)))
13		an4 656	. . . 4 ⊢ (((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥𝑔𝑢) ∧ (𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥ℎ𝑣)) ↔ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥 ∈ (dom 𝑔 ∩ dom ℎ)) ∧ (𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣)))
14	12, 13	bitri 275	. . 3 ⊢ ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣) ↔ ((𝑥 ∈ (dom 𝑔 ∩ dom ℎ) ∧ 𝑥 ∈ (dom 𝑔 ∩ dom ℎ)) ∧ (𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣)))
15	8, 8, 9, 14	syl21anbrc 1345	. 2 ⊢ ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
16		inss1 4196	. . . . . . . . 9 ⊢ (dom 𝑔 ∩ dom ℎ) ⊆ dom 𝑔
17		frrlem15.1	. . . . . . . . . 10 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
18	17	frrlem3 8244	. . . . . . . . 9 ⊢ (𝑔 ∈ 𝐵 → dom 𝑔 ⊆ 𝐴)
19	16, 18	sstrid 3955	. . . . . . . 8 ⊢ (𝑔 ∈ 𝐵 → (dom 𝑔 ∩ dom ℎ) ⊆ 𝐴)
20	19	ad2antrl 728	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → (dom 𝑔 ∩ dom ℎ) ⊆ 𝐴)
21		simpll 766	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → 𝑅 Fr 𝐴)
22		frss 5595	. . . . . . 7 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → (𝑅 Fr 𝐴 → 𝑅 Fr (dom 𝑔 ∩ dom ℎ)))
23	20, 21, 22	sylc 65	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → 𝑅 Fr (dom 𝑔 ∩ dom ℎ))
24		simplr 768	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → 𝑅 Se 𝐴)
25		sess2 5597	. . . . . . 7 ⊢ ((dom 𝑔 ∩ dom ℎ) ⊆ 𝐴 → (𝑅 Se 𝐴 → 𝑅 Se (dom 𝑔 ∩ dom ℎ)))
26	20, 24, 25	sylc 65	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → 𝑅 Se (dom 𝑔 ∩ dom ℎ))
27	17	frrlem4 8245	. . . . . . 7 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((𝑔 ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
28	27	adantl 481	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((𝑔 ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
29	17	frrlem4 8245	. . . . . . . . 9 ⊢ ((ℎ ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔) ∧ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))))
30		incom 4168	. . . . . . . . . . . 12 ⊢ (dom 𝑔 ∩ dom ℎ) = (dom ℎ ∩ dom 𝑔)
31	30	reseq2i 5936	. . . . . . . . . . 11 ⊢ (ℎ ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom ℎ ∩ dom 𝑔))
32		fneq12 6596	. . . . . . . . . . 11 ⊢ (((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom ℎ ∩ dom 𝑔)) ∧ (dom 𝑔 ∩ dom ℎ) = (dom ℎ ∩ dom 𝑔)) → ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ↔ (ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔)))
33	31, 30, 32	mp2an 692	. . . . . . . . . 10 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ↔ (ℎ ↾ (dom ℎ ∩ dom 𝑔)) Fn (dom ℎ ∩ dom 𝑔))
34	31	fveq1i 6841	. . . . . . . . . . . 12 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = ((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎)
35		predeq2 6265	. . . . . . . . . . . . . . 15 ⊢ ((dom 𝑔 ∩ dom ℎ) = (dom ℎ ∩ dom 𝑔) → Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎) = Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))
36	30, 35	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎) = Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)
37	31, 36	reseq12i 5937	. . . . . . . . . . . . 13 ⊢ ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)) = ((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))
38	37	oveq2i 7380	. . . . . . . . . . . 12 ⊢ (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) = (𝑎𝐺((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎)))
39	34, 38	eqeq12i 2747	. . . . . . . . . . 11 ⊢ (((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) ↔ ((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))))
40	30, 39	raleqbii 3314	. . . . . . . . . 10 ⊢ (∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎))) ↔ ∀𝑎 ∈ (dom ℎ ∩ dom 𝑔)((ℎ ↾ (dom ℎ ∩ dom 𝑔))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom ℎ ∩ dom 𝑔)) ↾ Pred(𝑅, (dom ℎ ∩ dom 𝑔), 𝑎))))
41	33, 40	anbi12i 628	. . . . . . . . 9 ⊢ (((ℎ ↾ (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 𝑔), 𝑎)))))
42	29, 41	sylibr 234	. . . . . . . 8 ⊢ ((ℎ ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
43	42	ancoms 458	. . . . . . 7 ⊢ ((𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵) → ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
44	43	adantl 481	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) Fn (dom 𝑔 ∩ dom ℎ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom ℎ)((ℎ ↾ (dom 𝑔 ∩ dom ℎ))‘𝑎) = (𝑎𝐺((ℎ ↾ (dom 𝑔 ∩ dom ℎ)) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ℎ), 𝑎)))))
45		frr3g 9685	. . . . . 6 ⊢ (((𝑅 Fr (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 ℎ)))
46	23, 26, 28, 44, 45	syl211anc 1378	. . . . 5 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ)))
47	46	breqd 5113	. . . 4 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → (𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣 ↔ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
48	47	biimprd 248	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → (𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣 → 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣))
49	17	frrlem2 8243	. . . . . 6 ⊢ (𝑔 ∈ 𝐵 → Fun 𝑔)
50	49	funresd 6543	. . . . 5 ⊢ (𝑔 ∈ 𝐵 → Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)))
51	50	ad2antrl 728	. . . 4 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)))
52		dffun2 6509	. . . . 5 ⊢ (Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ↔ (Rel (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) ∧ ∀𝑥∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣)))
53		2sp 2187	. . . . . 6 ⊢ (∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
54	53	sps 2186	. . . . 5 ⊢ (∀𝑥∀𝑢∀𝑣((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
55	52, 54	simplbiim 504	. . . 4 ⊢ (Fun (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
56	51, 55	syl 17	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
57	48, 56	sylan2d 605	. 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((𝑥(𝑔 ↾ (dom 𝑔 ∩ dom ℎ))𝑢 ∧ 𝑥(ℎ ↾ (dom 𝑔 ∩ dom ℎ))𝑣) → 𝑢 = 𝑣))
58	15, 57	syl5 34	1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑔 ∈ 𝐵 ∧ ℎ ∈ 𝐵)) → ((𝑥𝑔𝑢 ∧ 𝑥ℎ𝑣) → 𝑢 = 𝑣))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707  ∀wral 3044   ∩ cin 3910   ⊆ wss 3911   class class class wbr 5102   Fr wfr 5581   Se wse 5582  dom cdm 5631   ↾ cres 5633  Rel wrel 5636  Predcpred 6261  Fun wfun 6493   Fn wfn 6494  ‘cfv 6499  (class class class)co 7369  frecscfrecs 8236

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 5229  ax-sep 5246  ax-nul 5256  ax-pr 5382  ax-un 7691  ax-inf2 9570

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 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-oadd 8415  df-ttrcl 9637

This theorem is referenced by:  frr1  9688  frr2  9689