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

Theorem fpwrelmapffs 32942
Description: Define a canonical mapping between finite relations (finite subsets of a cartesian product) and functions with finite support into finite subsets. (Contributed by Thierry Arnoux, 28-Aug-2017.) (Revised by Thierry Arnoux, 1-Sep-2019.)
Hypotheses
Ref Expression
fpwrelmap.1 𝐴 ∈ V
fpwrelmap.2 𝐵 ∈ V
fpwrelmap.3 𝑀 = (𝑓 ∈ (𝒫 𝐵m 𝐴) ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
fpwrelmapffs.1 𝑆 = {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑m 𝐴) ∣ (𝑓 supp ∅) ∈ Fin}
Assertion
Ref Expression
fpwrelmapffs (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin)
Distinct variable groups:   𝑥,𝑓,𝑦,𝐴   𝐵,𝑓,𝑥,𝑦
Allowed substitution hints:   𝑆(𝑥,𝑦,𝑓)   𝑀(𝑥,𝑦,𝑓)

Proof of Theorem fpwrelmapffs
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fpwrelmap.3 . . . 4 𝑀 = (𝑓 ∈ (𝒫 𝐵m 𝐴) ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
2 fpwrelmap.1 . . . . . 6 𝐴 ∈ V
3 fpwrelmap.2 . . . . . 6 𝐵 ∈ V
42, 3, 1fpwrelmap 32941 . . . . 5 𝑀:(𝒫 𝐵m 𝐴)–1-1-onto→𝒫 (𝐴 × 𝐵)
54a1i 11 . . . 4 (⊤ → 𝑀:(𝒫 𝐵m 𝐴)–1-1-onto→𝒫 (𝐴 × 𝐵))
63pwex 5338 . . . . . . . 8 𝒫 𝐵 ∈ V
76, 2elmap 8853 . . . . . . 7 (𝑓 ∈ (𝒫 𝐵m 𝐴) ↔ 𝑓:𝐴⟶𝒫 𝐵)
87birani 507 . . . . . 6 ((𝑓 ∈ (𝒫 𝐵m 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → 𝑓:𝐴⟶𝒫 𝐵)
9 simpr 488 . . . . . 6 ((𝑓 ∈ (𝒫 𝐵m 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
102, 3, 8, 9fpwrelmapffslem 32940 . . . . 5 ((𝑓 ∈ (𝒫 𝐵m 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → (𝑟 ∈ Fin ↔ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)))
11103adant1 1144 . . . 4 ((⊤ ∧ 𝑓 ∈ (𝒫 𝐵m 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → (𝑟 ∈ Fin ↔ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)))
121, 5, 11f1oresrab 7109 . . 3 (⊤ → (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
1312mptru 1568 . 2 (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}
14 fpwrelmapffs.1 . . . . 5 𝑆 = {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑m 𝐴) ∣ (𝑓 supp ∅) ∈ Fin}
152, 6maprnin 32939 . . . . . 6 ((𝒫 𝐵 ∩ Fin) ↑m 𝐴) = {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin}
16 nfcv 2925 . . . . . . 7 𝑓((𝒫 𝐵 ∩ Fin) ↑m 𝐴)
17 nfrab1 3435 . . . . . . 7 𝑓{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin}
1816, 17rabeqf 3449 . . . . . 6 (((𝒫 𝐵 ∩ Fin) ↑m 𝐴) = {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin} → {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑m 𝐴) ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin})
1915, 18ax-mp 5 . . . . 5 {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑m 𝐴) ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin}
20 rabrab 3439 . . . . 5 {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}
2114, 19, 203eqtri 2790 . . . 4 𝑆 = {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}
22 dfin5 3913 . . . 4 (𝒫 (𝐴 × 𝐵) ∩ Fin) = {𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}
23 f1oeq23 6797 . . . 4 ((𝑆 = {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)} ∧ (𝒫 (𝐴 × 𝐵) ∩ Fin) = {𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}) → ((𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin) ↔ (𝑀𝑆):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}))
2421, 22, 23mp2an 702 . . 3 ((𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin) ↔ (𝑀𝑆):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
2521reseq2i 5962 . . . 4 (𝑀𝑆) = (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)})
26 f1oeq1 6794 . . . 4 ((𝑀𝑆) = (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}) → ((𝑀𝑆):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}))
2725, 26ax-mp 5 . . 3 ((𝑀𝑆):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
2824, 27bitr2i 278 . 2 ((𝑀 ↾ {𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵m 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin))
2913, 28mpbi 232 1 (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399   = wceq 1561  wtru 1562  wcel 2143  {crab 3415  Vcvv 3455  cin 3904  wss 3905  c0 4286  𝒫 cpw 4556  {copab 5163  cmpt 5182   × cxp 5646  ran crn 5649  cres 5650  wf 6517  1-1-ontowf1o 6520  cfv 6521  (class class class)co 7396   supp csupp 8140  m cmap 8808  Fincfn 8927
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7718  ax-ac2 10431
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-se 5602  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-isom 6530  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-supp 8141  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-1o 8437  df-er 8678  df-map 8810  df-en 8928  df-dom 8929  df-fin 8931  df-card 9909  df-acn 9912  df-ac 10084
This theorem is referenced by:  eulerpartlem1  34666
  Copyright terms: Public domain W3C validator