Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  imasetpreimafvbijlemf1 Structured version   Visualization version   GIF version

Theorem imasetpreimafvbijlemf1 47329
Description: Lemma for imasetpreimafvbij 47331: the mapping 𝐻 is an injective function into the range of function 𝐹. (Contributed by AV, 9-Mar-2024.) (Revised by AV, 22-Mar-2024.)
Hypotheses
Ref Expression
fundcmpsurinj.p 𝑃 = {𝑧 ∣ ∃𝑥𝐴 𝑧 = (𝐹 “ {(𝐹𝑥)})}
fundcmpsurinj.h 𝐻 = (𝑝𝑃 (𝐹𝑝))
Assertion
Ref Expression
imasetpreimafvbijlemf1 (𝐹 Fn 𝐴𝐻:𝑃1-1→(𝐹𝐴))
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧,𝑝   𝑃,𝑝   𝐴,𝑝,𝑥,𝑧   𝑥,𝑃
Allowed substitution hints:   𝑃(𝑧)   𝐻(𝑥,𝑧,𝑝)

Proof of Theorem imasetpreimafvbijlemf1
Dummy variables 𝑎 𝑏 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fundcmpsurinj.p . . 3 𝑃 = {𝑧 ∣ ∃𝑥𝐴 𝑧 = (𝐹 “ {(𝐹𝑥)})}
2 fundcmpsurinj.h . . 3 𝐻 = (𝑝𝑃 (𝐹𝑝))
31, 2imasetpreimafvbijlemf 47326 . 2 (𝐹 Fn 𝐴𝐻:𝑃⟶(𝐹𝐴))
41, 2imasetpreimafvbijlemfv1 47328 . . . . 5 ((𝐹 Fn 𝐴𝑠𝑃) → ∃𝑏𝑠 (𝐻𝑠) = (𝐹𝑏))
51, 2imasetpreimafvbijlemfv1 47328 . . . . 5 ((𝐹 Fn 𝐴𝑟𝑃) → ∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎))
64, 5anim12dan 619 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) → (∃𝑏𝑠 (𝐻𝑠) = (𝐹𝑏) ∧ ∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎)))
7 eqeq12 2752 . . . . . . . . . . . 12 (((𝐻𝑠) = (𝐹𝑏) ∧ (𝐻𝑟) = (𝐹𝑎)) → ((𝐻𝑠) = (𝐻𝑟) ↔ (𝐹𝑏) = (𝐹𝑎)))
87ancoms 458 . . . . . . . . . . 11 (((𝐻𝑟) = (𝐹𝑎) ∧ (𝐻𝑠) = (𝐹𝑏)) → ((𝐻𝑠) = (𝐻𝑟) ↔ (𝐹𝑏) = (𝐹𝑎)))
98adantl 481 . . . . . . . . . 10 (((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) ∧ ((𝐻𝑟) = (𝐹𝑎) ∧ (𝐻𝑠) = (𝐹𝑏))) → ((𝐻𝑠) = (𝐻𝑟) ↔ (𝐹𝑏) = (𝐹𝑎)))
10 simplll 775 . . . . . . . . . . . 12 ((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) → 𝐹 Fn 𝐴)
11 simpllr 776 . . . . . . . . . . . 12 ((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) → (𝑠𝑃𝑟𝑃))
12 simpr 484 . . . . . . . . . . . . 13 (((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) → 𝑏𝑠)
1312anim1i 615 . . . . . . . . . . . 12 ((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) → (𝑏𝑠𝑎𝑟))
141elsetpreimafveq 47322 . . . . . . . . . . . 12 ((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃) ∧ (𝑏𝑠𝑎𝑟)) → ((𝐹𝑏) = (𝐹𝑎) → 𝑠 = 𝑟))
1510, 11, 13, 14syl3anc 1370 . . . . . . . . . . 11 ((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) → ((𝐹𝑏) = (𝐹𝑎) → 𝑠 = 𝑟))
1615adantr 480 . . . . . . . . . 10 (((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) ∧ ((𝐻𝑟) = (𝐹𝑎) ∧ (𝐻𝑠) = (𝐹𝑏))) → ((𝐹𝑏) = (𝐹𝑎) → 𝑠 = 𝑟))
179, 16sylbid 240 . . . . . . . . 9 (((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) ∧ ((𝐻𝑟) = (𝐹𝑎) ∧ (𝐻𝑠) = (𝐹𝑏))) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))
1817exp32 420 . . . . . . . 8 ((((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) ∧ 𝑎𝑟) → ((𝐻𝑟) = (𝐹𝑎) → ((𝐻𝑠) = (𝐹𝑏) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))))
1918rexlimdva 3153 . . . . . . 7 (((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) → (∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎) → ((𝐻𝑠) = (𝐹𝑏) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))))
2019com23 86 . . . . . 6 (((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) ∧ 𝑏𝑠) → ((𝐻𝑠) = (𝐹𝑏) → (∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))))
2120rexlimdva 3153 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) → (∃𝑏𝑠 (𝐻𝑠) = (𝐹𝑏) → (∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))))
2221impd 410 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) → ((∃𝑏𝑠 (𝐻𝑠) = (𝐹𝑏) ∧ ∃𝑎𝑟 (𝐻𝑟) = (𝐹𝑎)) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟)))
236, 22mpd 15 . . 3 ((𝐹 Fn 𝐴 ∧ (𝑠𝑃𝑟𝑃)) → ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))
2423ralrimivva 3200 . 2 (𝐹 Fn 𝐴 → ∀𝑠𝑃𝑟𝑃 ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟))
25 dff13 7275 . 2 (𝐻:𝑃1-1→(𝐹𝐴) ↔ (𝐻:𝑃⟶(𝐹𝐴) ∧ ∀𝑠𝑃𝑟𝑃 ((𝐻𝑠) = (𝐻𝑟) → 𝑠 = 𝑟)))
263, 24, 25sylanbrc 583 1 (𝐹 Fn 𝐴𝐻:𝑃1-1→(𝐹𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  {cab 2712  wral 3059  wrex 3068  {csn 4631   cuni 4912  cmpt 5231  ccnv 5688  cima 5692   Fn wfn 6558  wf 6559  1-1wf1 6560  cfv 6563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fv 6571
This theorem is referenced by:  imasetpreimafvbij  47331
  Copyright terms: Public domain W3C validator