MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f1oresrab Structured version   Visualization version   GIF version

Theorem f1oresrab 7160
Description: Build a bijection between restricted abstract builders, given a bijection between the base classes, deduction version. (Contributed by Thierry Arnoux, 17-Aug-2018.)
Hypotheses
Ref Expression
f1oresrab.1 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1oresrab.2 (𝜑 → 𝐹:𝐴⟶1-1onto𝐵)
f1oresrab.3 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → (𝜒 ↔ 𝜓))
Assertion
Ref Expression
f1oresrab (𝜑 → (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝜑,𝑥,𝑦   𝜓,𝑦   𝜒,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐶(𝑥)   𝐹(𝑥, 𝑦)

Proof of Theorem f1oresrab
StepHypRef Expression
1 f1oresrab.2 . . . 4 (𝜑 → 𝐹:𝐴⟶1-1onto𝐵)
2 f1ofun 6856 . . . 4 (𝐹:𝐴⟶1-1onto𝐵 → Fun 𝐹)
3 funcnvcnv 6637 . . . 4 (Fun 𝐹 → Fun ◡◡𝐹)
41, 2, 33syl 19 . . 3 (𝜑 → Fun ◡◡𝐹)
5 f1ocnv 6867 . . . . . 6 (𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹:𝐵⟶1-1onto𝐴)
6 f1of1 6853 . . . . . 6 (◡𝐹:𝐵⟶1-1onto𝐴 → ◡𝐹:𝐵⟶1-1𝐴)
71, 5, 63syl 19 . . . . 5 (𝜑 → ◡𝐹:𝐵⟶1-1𝐴)
8 ssrab2 4008 . . . . 5 {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵
9 f1ores 6869 . . . . 5 ((◡𝐹:𝐵⟶1-1𝐴 ∧ {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵) → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
107, 8, 9sylancl 598 . . . 4 (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
11 f1oresrab.1 . . . . . . 7 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
1211mptpreima 6258 . . . . . 6 (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}}
13 f1oresrab.3 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → (𝜒 ↔ 𝜓))
14133expia 1139 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
1514alrimiv 1962 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
16 f1of 6854 . . . . . . . . . . 11 (𝐹:𝐴⟶1-1onto𝐵 → 𝐹:𝐴⟶𝐵)
171, 16syl 18 . . . . . . . . . 10 (𝜑 → 𝐹:𝐴⟶𝐵)
1811fmpt 7142 . . . . . . . . . 10 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
1917, 18sylibr 237 . . . . . . . . 9 (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
2019r19.21bi 3258 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
21 elrab3t 3647 . . . . . . . 8 ((∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)) ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
2215, 20, 21syl2anc 596 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
2322rabbidva 3422 . . . . . 6 (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}} = {𝑥 ∈ 𝐴 ∣ 𝜓})
2412, 23eqtrid 2810 . . . . 5 (𝜑 → (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝜓})
2524f1oeq3d 6851 . . . 4 (𝜑 → ((◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) ↔ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto{𝑥 ∈ 𝐴 ∣ 𝜓}))
2610, 25mpbid 235 . . 3 (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto{𝑥 ∈ 𝐴 ∣ 𝜓})
27 f1orescnv 6870 . . 3 ((Fun ◡◡𝐹 ∧ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}⟶1-1onto{𝑥 ∈ 𝐴 ∣ 𝜓}) → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒})
284, 26, 27syl2anc 596 . 2 (𝜑 → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒})
29 rescnvcnv 6224 . . 3 (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓})
30 f1oeq1 6842 . . 3 ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) → ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒}))
3129, 30ax-mp 5 . 2 ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒})
3228, 31sylib 221 1 (𝜑 → (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}⟶1-1onto{𝑦 ∈ 𝐵 ∣ 𝜒})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900   ↦ cmpt 5192  ◡ccnv 5657   ↾ cres 5660   “ cima 5661  Fun wfun 6560  ⟶wf 6562  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573
This theorem is used by:  f1ossf1o  7161  wlknwwlksnbij  30534  wlksnwwlknvbij  30554  clwlknf1oclwwlkn  30732  clwwlkvbij  30761  rabfodom  33200  fpwrelmapffs  33422  eulerpartlemn  35124  f1oresf1orab  48693
  Copyright terms: Public domain W3C validator