Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnrelpredd Structured version   Visualization version   GIF version

Theorem fnrelpredd 33166
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.
StepHypRef Expression
1 fvex 6824 . . . . 5 (𝐹𝐷) ∈ V
21dfpred3 6235 . . . 4 Pred(𝑆, (𝐹𝐶), (𝐹𝐷)) = {𝑣 ∈ (𝐹𝐶) ∣ 𝑣𝑆(𝐹𝐷)}
3 elrabi 3628 . . . . . . . . . . 11 (𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} → 𝑢𝐶)
43anim1i 615 . . . . . . . . . 10 ((𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ∧ (𝐹𝑢) = 𝑣) → (𝑢𝐶 ∧ (𝐹𝑢) = 𝑣))
54reximi2 3079 . . . . . . . . 9 (∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣 → ∃𝑢𝐶 (𝐹𝑢) = 𝑣)
6 fnrelpredd.1 . . . . . . . . . 10 (𝜑𝐹 Fn 𝐴)
7 fnrelpredd.3 . . . . . . . . . 10 (𝜑𝐶𝐴)
86, 7fvelimabd 6881 . . . . . . . . 9 (𝜑 → (𝑣 ∈ (𝐹𝐶) ↔ ∃𝑢𝐶 (𝐹𝑢) = 𝑣))
95, 8syl5ibr 245 . . . . . . . 8 (𝜑 → (∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣𝑣 ∈ (𝐹𝐶)))
10 fveq2 6811 . . . . . . . . . . . 12 (𝑥 = 𝑢 → (𝐹𝑥) = (𝐹𝑢))
1110breq1d 5097 . . . . . . . . . . 11 (𝑥 = 𝑢 → ((𝐹𝑥)𝑆(𝐹𝐷) ↔ (𝐹𝑢)𝑆(𝐹𝐷)))
1211elrab 3634 . . . . . . . . . 10 (𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ↔ (𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷)))
13 breq1 5090 . . . . . . . . . . . 12 ((𝐹𝑢) = 𝑣 → ((𝐹𝑢)𝑆(𝐹𝐷) ↔ 𝑣𝑆(𝐹𝐷)))
1413biimpac 479 . . . . . . . . . . 11 (((𝐹𝑢)𝑆(𝐹𝐷) ∧ (𝐹𝑢) = 𝑣) → 𝑣𝑆(𝐹𝐷))
1514adantll 711 . . . . . . . . . 10 (((𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷)) ∧ (𝐹𝑢) = 𝑣) → 𝑣𝑆(𝐹𝐷))
1612, 15sylanb 581 . . . . . . . . 9 ((𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ∧ (𝐹𝑢) = 𝑣) → 𝑣𝑆(𝐹𝐷))
1716rexlimiva 3141 . . . . . . . 8 (∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣𝑣𝑆(𝐹𝐷))
189, 17jca2 514 . . . . . . 7 (𝜑 → (∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣 → (𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷))))
198biimpd 228 . . . . . . . . 9 (𝜑 → (𝑣 ∈ (𝐹𝐶) → ∃𝑢𝐶 (𝐹𝑢) = 𝑣))
2019adantrd 492 . . . . . . . 8 (𝜑 → ((𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷)) → ∃𝑢𝐶 (𝐹𝑢) = 𝑣))
21 simpl 483 . . . . . . . . . . . . 13 ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → 𝑢𝐶)
2221a1i 11 . . . . . . . . . . . 12 (𝑣𝑆(𝐹𝐷) → ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → 𝑢𝐶))
2313biimprcd 249 . . . . . . . . . . . . 13 (𝑣𝑆(𝐹𝐷) → ((𝐹𝑢) = 𝑣 → (𝐹𝑢)𝑆(𝐹𝐷)))
2423adantld 491 . . . . . . . . . . . 12 (𝑣𝑆(𝐹𝐷) → ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → (𝐹𝑢)𝑆(𝐹𝐷)))
25 simpr 485 . . . . . . . . . . . . 13 ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → (𝐹𝑢) = 𝑣)
2625a1i 11 . . . . . . . . . . . 12 (𝑣𝑆(𝐹𝐷) → ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → (𝐹𝑢) = 𝑣))
2722, 24, 263jcad 1128 . . . . . . . . . . 11 (𝑣𝑆(𝐹𝐷) → ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → (𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷) ∧ (𝐹𝑢) = 𝑣)))
2812biimpri 227 . . . . . . . . . . . . 13 ((𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷)) → 𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)})
2928anim1i 615 . . . . . . . . . . . 12 (((𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷)) ∧ (𝐹𝑢) = 𝑣) → (𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ∧ (𝐹𝑢) = 𝑣))
30293impa 1109 . . . . . . . . . . 11 ((𝑢𝐶 ∧ (𝐹𝑢)𝑆(𝐹𝐷) ∧ (𝐹𝑢) = 𝑣) → (𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ∧ (𝐹𝑢) = 𝑣))
3127, 30syl6 35 . . . . . . . . . 10 (𝑣𝑆(𝐹𝐷) → ((𝑢𝐶 ∧ (𝐹𝑢) = 𝑣) → (𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ∧ (𝐹𝑢) = 𝑣)))
3231reximdv2 3158 . . . . . . . . 9 (𝑣𝑆(𝐹𝐷) → (∃𝑢𝐶 (𝐹𝑢) = 𝑣 → ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣))
3332adantl 482 . . . . . . . 8 ((𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷)) → (∃𝑢𝐶 (𝐹𝑢) = 𝑣 → ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣))
3420, 33sylcom 30 . . . . . . 7 (𝜑 → ((𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷)) → ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣))
3518, 34impbid 211 . . . . . 6 (𝜑 → (∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣 ↔ (𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷))))
3635abbidv 2806 . . . . 5 (𝜑 → {𝑣 ∣ ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣} = {𝑣 ∣ (𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷))})
37 df-rab 3405 . . . . 5 {𝑣 ∈ (𝐹𝐶) ∣ 𝑣𝑆(𝐹𝐷)} = {𝑣 ∣ (𝑣 ∈ (𝐹𝐶) ∧ 𝑣𝑆(𝐹𝐷))}
3836, 37eqtr4di 2795 . . . 4 (𝜑 → {𝑣 ∣ ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣} = {𝑣 ∈ (𝐹𝐶) ∣ 𝑣𝑆(𝐹𝐷)})
392, 38eqtr4id 2796 . . 3 (𝜑 → Pred(𝑆, (𝐹𝐶), (𝐹𝐷)) = {𝑣 ∣ ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣})
40 fnfun 6571 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
416, 40syl 17 . . . 4 (𝜑 → Fun 𝐹)
42 ssrab2 4024 . . . . . 6 {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ⊆ 𝐶
4342, 7sstrid 3942 . . . . 5 (𝜑 → {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ⊆ 𝐴)
446fndmd 6576 . . . . 5 (𝜑 → dom 𝐹 = 𝐴)
4543, 44sseqtrrd 3972 . . . 4 (𝜑 → {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ⊆ dom 𝐹)
46 dfimafn 6871 . . . 4 ((Fun 𝐹 ∧ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} ⊆ dom 𝐹) → (𝐹 “ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)}) = {𝑣 ∣ ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣})
4741, 45, 46syl2anc 584 . . 3 (𝜑 → (𝐹 “ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)}) = {𝑣 ∣ ∃𝑢 ∈ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)} (𝐹𝑢) = 𝑣})
4839, 47eqtr4d 2780 . 2 (𝜑 → Pred(𝑆, (𝐹𝐶), (𝐹𝐷)) = (𝐹 “ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)}))
49 fnrelpredd.4 . . . . 5 (𝜑𝐷𝐴)
50 dfpred3g 6236 . . . . 5 (𝐷𝐴 → Pred(𝑅, 𝐶, 𝐷) = {𝑥𝐶𝑥𝑅𝐷})
5149, 50syl 17 . . . 4 (𝜑 → Pred(𝑅, 𝐶, 𝐷) = {𝑥𝐶𝑥𝑅𝐷})
527sselda 3931 . . . . . 6 ((𝜑𝑥𝐶) → 𝑥𝐴)
53 fnrelpredd.2 . . . . . . . 8 (𝜑 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)))
5453r19.21bi 3231 . . . . . . 7 ((𝜑𝑥𝐴) → ∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)))
55 breq2 5091 . . . . . . . . . . 11 (𝑦 = 𝐷 → (𝑥𝑅𝑦𝑥𝑅𝐷))
56 fveq2 6811 . . . . . . . . . . . 12 (𝑦 = 𝐷 → (𝐹𝑦) = (𝐹𝐷))
5756breq2d 5099 . . . . . . . . . . 11 (𝑦 = 𝐷 → ((𝐹𝑥)𝑆(𝐹𝑦) ↔ (𝐹𝑥)𝑆(𝐹𝐷)))
5855, 57bibi12d 345 . . . . . . . . . 10 (𝑦 = 𝐷 → ((𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)) ↔ (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷))))
5958rspcv 3566 . . . . . . . . 9 (𝐷𝐴 → (∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷))))
6049, 59syl 17 . . . . . . . 8 (𝜑 → (∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷))))
6160adantr 481 . . . . . . 7 ((𝜑𝑥𝐴) → (∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐹𝑥)𝑆(𝐹𝑦)) → (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷))))
6254, 61mpd 15 . . . . . 6 ((𝜑𝑥𝐴) → (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷)))
6352, 62syldan 591 . . . . 5 ((𝜑𝑥𝐶) → (𝑥𝑅𝐷 ↔ (𝐹𝑥)𝑆(𝐹𝐷)))
6463rabbidva 3411 . . . 4 (𝜑 → {𝑥𝐶𝑥𝑅𝐷} = {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)})
6551, 64eqtrd 2777 . . 3 (𝜑 → Pred(𝑅, 𝐶, 𝐷) = {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)})
6665imaeq2d 5986 . 2 (𝜑 → (𝐹 “ Pred(𝑅, 𝐶, 𝐷)) = (𝐹 “ {𝑥𝐶 ∣ (𝐹𝑥)𝑆(𝐹𝐷)}))
6748, 66eqtr4d 2780 1 (𝜑 → Pred(𝑆, (𝐹𝐶), (𝐹𝐷)) = (𝐹 “ Pred(𝑅, 𝐶, 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wcel 2105  {cab 2714  wral 3062  wrex 3071  {crab 3404  wss 3897   class class class wbr 5087  dom cdm 5607  cima 5610  Predcpred 6223  Fun wfun 6459   Fn wfn 6460  cfv 6465
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-12 2170  ax-ext 2708  ax-sep 5238  ax-nul 5245  ax-pr 5367
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3443  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4268  df-if 4472  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4851  df-br 5088  df-opab 5150  df-id 5507  df-xp 5613  df-rel 5614  df-cnv 5615  df-co 5616  df-dm 5617  df-rn 5618  df-res 5619  df-ima 5620  df-pred 6224  df-iota 6417  df-fun 6467  df-fn 6468  df-fv 6473
This theorem is referenced by:  cardpred  33167
  Copyright terms: Public domain W3C validator