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

Theorem f1oresf1o2 47883
Description: Build a bijection by restricting the domain of a bijection. (Contributed by AV, 31-Jul-2022.)
Hypotheses
Ref Expression
f1oresf1o2.1 (𝜑𝐹:𝐴1-1-onto𝐵)
f1oresf1o2.2 (𝜑𝐷𝐴)
f1oresf1o2.3 ((𝜑𝑦 = (𝐹𝑥)) → (𝑥𝐷𝜒))
Assertion
Ref Expression
f1oresf1o2 (𝜑 → (𝐹𝐷):𝐷1-1-onto→{𝑦𝐵𝜒})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑦,𝐷   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦   𝜒,𝑥
Allowed substitution hints:   𝜒(𝑦)   𝐴(𝑦)   𝐵(𝑦)

Proof of Theorem f1oresf1o2
StepHypRef Expression
1 f1oresf1o2.1 . 2 (𝜑𝐹:𝐴1-1-onto𝐵)
2 f1oresf1o2.2 . 2 (𝜑𝐷𝐴)
3 f1of 6810 . . . . . . . . . . 11 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
41, 3syl 18 . . . . . . . . . 10 (𝜑𝐹:𝐴𝐵)
54adantr 485 . . . . . . . . 9 ((𝜑𝑥𝐷) → 𝐹:𝐴𝐵)
62sselda 3939 . . . . . . . . 9 ((𝜑𝑥𝐷) → 𝑥𝐴)
75, 6jca 520 . . . . . . . 8 ((𝜑𝑥𝐷) → (𝐹:𝐴𝐵𝑥𝐴))
873adant3 1148 . . . . . . 7 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → (𝐹:𝐴𝐵𝑥𝐴))
9 ffvelcdm 7066 . . . . . . 7 ((𝐹:𝐴𝐵𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
108, 9syl 18 . . . . . 6 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → (𝐹𝑥) ∈ 𝐵)
11 eleq1 2853 . . . . . . 7 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝐵𝑦𝐵))
12113ad2ant3 1151 . . . . . 6 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → ((𝐹𝑥) ∈ 𝐵𝑦𝐵))
1310, 12mpbid 235 . . . . 5 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐵)
14 eqcom 2772 . . . . . . . 8 ((𝐹𝑥) = 𝑦𝑦 = (𝐹𝑥))
15 f1oresf1o2.3 . . . . . . . . . 10 ((𝜑𝑦 = (𝐹𝑥)) → (𝑥𝐷𝜒))
1615biimpd 232 . . . . . . . . 9 ((𝜑𝑦 = (𝐹𝑥)) → (𝑥𝐷𝜒))
1716ex 417 . . . . . . . 8 (𝜑 → (𝑦 = (𝐹𝑥) → (𝑥𝐷𝜒)))
1814, 17biimtrid 245 . . . . . . 7 (𝜑 → ((𝐹𝑥) = 𝑦 → (𝑥𝐷𝜒)))
1918com23 87 . . . . . 6 (𝜑 → (𝑥𝐷 → ((𝐹𝑥) = 𝑦𝜒)))
20193imp 1126 . . . . 5 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → 𝜒)
2113, 20jca 520 . . . 4 ((𝜑𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → (𝑦𝐵𝜒))
2221rexlimdv3a 3170 . . 3 (𝜑 → (∃𝑥𝐷 (𝐹𝑥) = 𝑦 → (𝑦𝐵𝜒)))
23 f1ofo 6818 . . . . . . . 8 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴onto𝐵)
241, 23syl 18 . . . . . . 7 (𝜑𝐹:𝐴onto𝐵)
25 foelcdmi 6932 . . . . . . 7 ((𝐹:𝐴onto𝐵𝑦𝐵) → ∃𝑥𝐴 (𝐹𝑥) = 𝑦)
2624, 25sylan 591 . . . . . 6 ((𝜑𝑦𝐵) → ∃𝑥𝐴 (𝐹𝑥) = 𝑦)
2726ex 417 . . . . 5 (𝜑 → (𝑦𝐵 → ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
28 nfv 1937 . . . . . 6 𝑥𝜑
29 nfv 1937 . . . . . . 7 𝑥𝜒
30 nfre1 3290 . . . . . . 7 𝑥𝑥𝐷 (𝐹𝑥) = 𝑦
3129, 30nfim 1919 . . . . . 6 𝑥(𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)
32 rspe 3255 . . . . . . . . . . . . . 14 ((𝑥𝐷 ∧ (𝐹𝑥) = 𝑦) → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)
3332expcom 418 . . . . . . . . . . . . 13 ((𝐹𝑥) = 𝑦 → (𝑥𝐷 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))
3433eqcoms 2773 . . . . . . . . . . . 12 (𝑦 = (𝐹𝑥) → (𝑥𝐷 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))
3534adantl 486 . . . . . . . . . . 11 ((𝜑𝑦 = (𝐹𝑥)) → (𝑥𝐷 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))
3615, 35sylbird 263 . . . . . . . . . 10 ((𝜑𝑦 = (𝐹𝑥)) → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))
3736ex 417 . . . . . . . . 9 (𝜑 → (𝑦 = (𝐹𝑥) → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)))
3837adantr 485 . . . . . . . 8 ((𝜑𝑥𝐴) → (𝑦 = (𝐹𝑥) → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)))
3914, 38biimtrid 245 . . . . . . 7 ((𝜑𝑥𝐴) → ((𝐹𝑥) = 𝑦 → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)))
4039ex 417 . . . . . 6 (𝜑 → (𝑥𝐴 → ((𝐹𝑥) = 𝑦 → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))))
4128, 31, 40rexlimd 3272 . . . . 5 (𝜑 → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)))
4227, 41syld 48 . . . 4 (𝜑 → (𝑦𝐵 → (𝜒 → ∃𝑥𝐷 (𝐹𝑥) = 𝑦)))
4342impd 415 . . 3 (𝜑 → ((𝑦𝐵𝜒) → ∃𝑥𝐷 (𝐹𝑥) = 𝑦))
4422, 43impbid 215 . 2 (𝜑 → (∃𝑥𝐷 (𝐹𝑥) = 𝑦 ↔ (𝑦𝐵𝜒)))
451, 2, 44f1oresf1o 47882 1 (𝜑 → (𝐹𝐷):𝐷1-1-onto→{𝑦𝐵𝜒})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1563  wcel 2145  wrex 3089  {crab 3417  wss 3907  cres 5654  wf 6521  ontowfo 6523  1-1-ontowf1o 6524  cfv 6525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator