ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1oresrab GIF version

Theorem f1oresrab 5864
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-1-onto𝐵)
f1oresrab.3 ((𝜑𝑥𝐴𝑦 = 𝐶) → (𝜒𝜓))
Assertion
Ref Expression
f1oresrab (𝜑 → (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝜑,𝑥,𝑦   𝜓,𝑦   𝜒,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐶(𝑥)   𝐹(𝑥,𝑦)

Proof of Theorem f1oresrab
StepHypRef Expression
1 f1oresrab.2 . . . 4 (𝜑𝐹:𝐴1-1-onto𝐵)
2 f1ofun 5636 . . . 4 (𝐹:𝐴1-1-onto𝐵 → Fun 𝐹)
3 funcnvcnv 5435 . . . 4 (Fun 𝐹 → Fun 𝐹)
41, 2, 33syl 17 . . 3 (𝜑 → Fun 𝐹)
5 f1ocnv 5647 . . . . . . 7 (𝐹:𝐴1-1-onto𝐵𝐹:𝐵1-1-onto𝐴)
61, 5syl 14 . . . . . 6 (𝜑𝐹:𝐵1-1-onto𝐴)
7 f1of1 5633 . . . . . 6 (𝐹:𝐵1-1-onto𝐴𝐹:𝐵1-1𝐴)
86, 7syl 14 . . . . 5 (𝜑𝐹:𝐵1-1𝐴)
9 ssrab2 3333 . . . . 5 {𝑦𝐵𝜒} ⊆ 𝐵
10 f1ores 5649 . . . . 5 ((𝐹:𝐵1-1𝐴 ∧ {𝑦𝐵𝜒} ⊆ 𝐵) → (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→(𝐹 “ {𝑦𝐵𝜒}))
118, 9, 10sylancl 417 . . . 4 (𝜑 → (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→(𝐹 “ {𝑦𝐵𝜒}))
12 f1oresrab.1 . . . . . . 7 𝐹 = (𝑥𝐴𝐶)
1312mptpreima 5276 . . . . . 6 (𝐹 “ {𝑦𝐵𝜒}) = {𝑥𝐴𝐶 ∈ {𝑦𝐵𝜒}}
14 f1oresrab.3 . . . . . . . . . 10 ((𝜑𝑥𝐴𝑦 = 𝐶) → (𝜒𝜓))
15143expia 1236 . . . . . . . . 9 ((𝜑𝑥𝐴) → (𝑦 = 𝐶 → (𝜒𝜓)))
1615alrimiv 1927 . . . . . . . 8 ((𝜑𝑥𝐴) → ∀𝑦(𝑦 = 𝐶 → (𝜒𝜓)))
17 f1of 5634 . . . . . . . . . . 11 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
181, 17syl 14 . . . . . . . . . 10 (𝜑𝐹:𝐴𝐵)
1912fmpt 5849 . . . . . . . . . 10 (∀𝑥𝐴 𝐶𝐵𝐹:𝐴𝐵)
2018, 19sylibr 134 . . . . . . . . 9 (𝜑 → ∀𝑥𝐴 𝐶𝐵)
2120r19.21bi 2638 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐶𝐵)
22 elrab3t 2981 . . . . . . . 8 ((∀𝑦(𝑦 = 𝐶 → (𝜒𝜓)) ∧ 𝐶𝐵) → (𝐶 ∈ {𝑦𝐵𝜒} ↔ 𝜓))
2316, 21, 22syl2anc 415 . . . . . . 7 ((𝜑𝑥𝐴) → (𝐶 ∈ {𝑦𝐵𝜒} ↔ 𝜓))
2423rabbidva 2809 . . . . . 6 (𝜑 → {𝑥𝐴𝐶 ∈ {𝑦𝐵𝜒}} = {𝑥𝐴𝜓})
2513, 24eqtrid 2283 . . . . 5 (𝜑 → (𝐹 “ {𝑦𝐵𝜒}) = {𝑥𝐴𝜓})
26 f1oeq3 5624 . . . . 5 ((𝐹 “ {𝑦𝐵𝜒}) = {𝑥𝐴𝜓} → ((𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→(𝐹 “ {𝑦𝐵𝜒}) ↔ (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→{𝑥𝐴𝜓}))
2725, 26syl 14 . . . 4 (𝜑 → ((𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→(𝐹 “ {𝑦𝐵𝜒}) ↔ (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→{𝑥𝐴𝜓}))
2811, 27mpbid 147 . . 3 (𝜑 → (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→{𝑥𝐴𝜓})
29 f1orescnv 5650 . . 3 ((Fun 𝐹 ∧ (𝐹 ↾ {𝑦𝐵𝜒}):{𝑦𝐵𝜒}–1-1-onto→{𝑥𝐴𝜓}) → (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒})
304, 28, 29syl2anc 415 . 2 (𝜑 → (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒})
31 rescnvcnv 5245 . . 3 (𝐹 ↾ {𝑥𝐴𝜓}) = (𝐹 ↾ {𝑥𝐴𝜓})
32 f1oeq1 5622 . . 3 ((𝐹 ↾ {𝑥𝐴𝜓}) = (𝐹 ↾ {𝑥𝐴𝜓}) → ((𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒} ↔ (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒}))
3331, 32ax-mp 5 . 2 ((𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒} ↔ (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒})
3430, 33sylib 122 1 (𝜑 → (𝐹 ↾ {𝑥𝐴𝜓}):{𝑥𝐴𝜓}–1-1-onto→{𝑦𝐵𝜒})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1009  wal 1400   = wceq 1402  wcel 2209  wral 2528  {crab 2532  wss 3220  cmpt 4187  ccnv 4768  cres 4771  cima 4772  Fun wfun 5366  wf 5368  1-1wf1 5369  1-1-ontowf1o 5371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator