Theorem fnrelpredd 35097

Description: A function that preserves a relation also preserves predecessors. (Contributed by BTernaryTau, 16-Jul-2024.)

Hypotheses

Ref	Expression
fnrelpredd.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
fnrelpredd.2	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
fnrelpredd.3	⊢ (𝜑 → 𝐶 ⊆ 𝐴)
fnrelpredd.4	⊢ (𝜑 → 𝐷 ∈ 𝐴)

Assertion

Ref	Expression
fnrelpredd	⊢ (𝜑 → Pred(𝑆, (𝐹 “ 𝐶), (𝐹‘𝐷)) = (𝐹 “ Pred(𝑅, 𝐶, 𝐷)))

Distinct variable groups:   𝑦,𝐴   𝜑,𝑥   𝑥,𝐷,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦   𝑥,𝐹,𝑦   𝑥,𝐶

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑥)   𝐶(𝑦)

Proof of Theorem fnrelpredd

Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6835	. . . . 5 ⊢ (𝐹‘𝐷) ∈ V
2	1	dfpred3 6259	. . . 4 ⊢ Pred(𝑆, (𝐹 “ 𝐶), (𝐹‘𝐷)) = {𝑣 ∈ (𝐹 “ 𝐶) ∣ 𝑣𝑆(𝐹‘𝐷)}
3		elrabi 3643	. . . . . . . . . . 11 ⊢ (𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} → 𝑢 ∈ 𝐶)
4	3	anim1i 615	. . . . . . . . . 10 ⊢ ((𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ∧ (𝐹‘𝑢) = 𝑣) → (𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣))
5	4	reximi2 3065	. . . . . . . . 9 ⊢ (∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣 → ∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣)
6		fnrelpredd.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 Fn 𝐴)
7		fnrelpredd.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ⊆ 𝐴)
8	6, 7	fvelimabd 6895	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ (𝐹 “ 𝐶) ↔ ∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣))
9	5, 8	imbitrrid 246	. . . . . . . 8 ⊢ (𝜑 → (∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣 → 𝑣 ∈ (𝐹 “ 𝐶)))
10		fveq2 6822	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑢 → (𝐹‘𝑥) = (𝐹‘𝑢))
11	10	breq1d 5101	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑢 → ((𝐹‘𝑥)𝑆(𝐹‘𝐷) ↔ (𝐹‘𝑢)𝑆(𝐹‘𝐷)))
12	11	elrab 3647	. . . . . . . . . 10 ⊢ (𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ↔ (𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷)))
13		breq1 5094	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑢) = 𝑣 → ((𝐹‘𝑢)𝑆(𝐹‘𝐷) ↔ 𝑣𝑆(𝐹‘𝐷)))
14	13	biimpac 478	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑢)𝑆(𝐹‘𝐷) ∧ (𝐹‘𝑢) = 𝑣) → 𝑣𝑆(𝐹‘𝐷))
15	14	adantll 714	. . . . . . . . . 10 ⊢ (((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷)) ∧ (𝐹‘𝑢) = 𝑣) → 𝑣𝑆(𝐹‘𝐷))
16	12, 15	sylanb 581	. . . . . . . . 9 ⊢ ((𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ∧ (𝐹‘𝑢) = 𝑣) → 𝑣𝑆(𝐹‘𝐷))
17	16	rexlimiva 3125	. . . . . . . 8 ⊢ (∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣 → 𝑣𝑆(𝐹‘𝐷))
18	9, 17	jca2 513	. . . . . . 7 ⊢ (𝜑 → (∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣 → (𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷))))
19	8	biimpd 229	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ (𝐹 “ 𝐶) → ∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣))
20	19	adantrd 491	. . . . . . . 8 ⊢ (𝜑 → ((𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷)) → ∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣))
21		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → 𝑢 ∈ 𝐶)
22	21	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → 𝑢 ∈ 𝐶))
23	13	biimprcd 250	. . . . . . . . . . . . 13 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝐹‘𝑢) = 𝑣 → (𝐹‘𝑢)𝑆(𝐹‘𝐷)))
24	23	adantld 490	. . . . . . . . . . . 12 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → (𝐹‘𝑢)𝑆(𝐹‘𝐷)))
25		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → (𝐹‘𝑢) = 𝑣)
26	25	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → (𝐹‘𝑢) = 𝑣))
27	22, 24, 26	3jcad 1129	. . . . . . . . . . 11 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → (𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷) ∧ (𝐹‘𝑢) = 𝑣)))
28	12	biimpri 228	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷)) → 𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)})
29	28	anim1i 615	. . . . . . . . . . . 12 ⊢ (((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷)) ∧ (𝐹‘𝑢) = 𝑣) → (𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ∧ (𝐹‘𝑢) = 𝑣))
30	29	3impa 1109	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢)𝑆(𝐹‘𝐷) ∧ (𝐹‘𝑢) = 𝑣) → (𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ∧ (𝐹‘𝑢) = 𝑣))
31	27, 30	syl6 35	. . . . . . . . . 10 ⊢ (𝑣𝑆(𝐹‘𝐷) → ((𝑢 ∈ 𝐶 ∧ (𝐹‘𝑢) = 𝑣) → (𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ∧ (𝐹‘𝑢) = 𝑣)))
32	31	reximdv2 3142	. . . . . . . . 9 ⊢ (𝑣𝑆(𝐹‘𝐷) → (∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣 → ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣))
33	32	adantl 481	. . . . . . . 8 ⊢ ((𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷)) → (∃𝑢 ∈ 𝐶 (𝐹‘𝑢) = 𝑣 → ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣))
34	20, 33	sylcom 30	. . . . . . 7 ⊢ (𝜑 → ((𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷)) → ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣))
35	18, 34	impbid 212	. . . . . 6 ⊢ (𝜑 → (∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣 ↔ (𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷))))
36	35	abbidv 2797	. . . . 5 ⊢ (𝜑 → {𝑣 ∣ ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣} = {𝑣 ∣ (𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷))})
37		df-rab 3396	. . . . 5 ⊢ {𝑣 ∈ (𝐹 “ 𝐶) ∣ 𝑣𝑆(𝐹‘𝐷)} = {𝑣 ∣ (𝑣 ∈ (𝐹 “ 𝐶) ∧ 𝑣𝑆(𝐹‘𝐷))}
38	36, 37	eqtr4di 2784	. . . 4 ⊢ (𝜑 → {𝑣 ∣ ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣} = {𝑣 ∈ (𝐹 “ 𝐶) ∣ 𝑣𝑆(𝐹‘𝐷)})
39	2, 38	eqtr4id 2785	. . 3 ⊢ (𝜑 → Pred(𝑆, (𝐹 “ 𝐶), (𝐹‘𝐷)) = {𝑣 ∣ ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣})
40		fnfun 6581	. . . . 5 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
41	6, 40	syl 17	. . . 4 ⊢ (𝜑 → Fun 𝐹)
42		ssrab2 4030	. . . . . 6 ⊢ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ⊆ 𝐶
43	42, 7	sstrid 3946	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ⊆ 𝐴)
44	6	fndmd 6586	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴)
45	43, 44	sseqtrrd 3972	. . . 4 ⊢ (𝜑 → {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ⊆ dom 𝐹)
46		dfimafn 6884	. . . 4 ⊢ ((Fun 𝐹 ∧ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} ⊆ dom 𝐹) → (𝐹 “ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)}) = {𝑣 ∣ ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣})
47	41, 45, 46	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹 “ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)}) = {𝑣 ∣ ∃𝑢 ∈ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)} (𝐹‘𝑢) = 𝑣})
48	39, 47	eqtr4d 2769	. 2 ⊢ (𝜑 → Pred(𝑆, (𝐹 “ 𝐶), (𝐹‘𝐷)) = (𝐹 “ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)}))
49		fnrelpredd.4	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝐴)
50		dfpred3g 6260	. . . . 5 ⊢ (𝐷 ∈ 𝐴 → Pred(𝑅, 𝐶, 𝐷) = {𝑥 ∈ 𝐶 ∣ 𝑥𝑅𝐷})
51	49, 50	syl 17	. . . 4 ⊢ (𝜑 → Pred(𝑅, 𝐶, 𝐷) = {𝑥 ∈ 𝐶 ∣ 𝑥𝑅𝐷})
52	7	sselda 3934	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐴)
53		fnrelpredd.2	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
54	53	r19.21bi 3224	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)))
55		breq2 5095	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐷 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝐷))
56		fveq2 6822	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐷 → (𝐹‘𝑦) = (𝐹‘𝐷))
57	56	breq2d 5103	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐷 → ((𝐹‘𝑥)𝑆(𝐹‘𝑦) ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷)))
58	55, 57	bibi12d 345	. . . . . . . . . 10 ⊢ (𝑦 = 𝐷 → ((𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)) ↔ (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷))))
59	58	rspcv 3573	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷))))
60	49, 59	syl 17	. . . . . . . 8 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷))))
61	60	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷))))
62	54, 61	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷)))
63	52, 62	syldan 591	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥𝑅𝐷 ↔ (𝐹‘𝑥)𝑆(𝐹‘𝐷)))
64	63	rabbidva 3401	. . . 4 ⊢ (𝜑 → {𝑥 ∈ 𝐶 ∣ 𝑥𝑅𝐷} = {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)})
65	51, 64	eqtrd 2766	. . 3 ⊢ (𝜑 → Pred(𝑅, 𝐶, 𝐷) = {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)})
66	65	imaeq2d 6009	. 2 ⊢ (𝜑 → (𝐹 “ Pred(𝑅, 𝐶, 𝐷)) = (𝐹 “ {𝑥 ∈ 𝐶 ∣ (𝐹‘𝑥)𝑆(𝐹‘𝐷)}))
67	48, 66	eqtr4d 2769	1 ⊢ (𝜑 → Pred(𝑆, (𝐹 “ 𝐶), (𝐹‘𝐷)) = (𝐹 “ Pred(𝑅, 𝐶, 𝐷)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  {cab 2709  ∀wral 3047  ∃wrex 3056  {crab 3395   ⊆ wss 3902   class class class wbr 5091  dom cdm 5616   “ cima 5619  Predcpred 6247  Fun wfun 6475   Fn wfn 6476  ‘cfv 6481

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 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5092  df-opab 5154  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-iota 6437  df-fun 6483  df-fn 6484  df-fv 6489

This theorem is referenced by:  cardpred  35098