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

Theorem cnvresima 4830
Description: An image under the converse of a restriction. (Contributed by Jeff Hankins, 12-Jul-2009.)
Assertion
Ref Expression
cnvresima ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)

Proof of Theorem cnvresima
Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2604 . . . 4 𝑡 ∈ V
21elima3 4695 . . 3 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)))
31elima3 4695 . . . . 5 (𝑡 ∈ (𝐹𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹))
43anbi1i 445 . . . 4 ((𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
5 elin 3155 . . . 4 (𝑡 ∈ ((𝐹𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
6 vex 2604 . . . . . . . . . 10 𝑠 ∈ V
76, 1opelcnv 4535 . . . . . . . . 9 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴))
86opelres 4635 . . . . . . . . . 10 (⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹𝑡𝐴))
96, 1opelcnv 4535 . . . . . . . . . . 11 (⟨𝑠, 𝑡⟩ ∈ 𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
109anbi1i 445 . . . . . . . . . 10 ((⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹𝑡𝐴))
118, 10bitr4i 185 . . . . . . . . 9 (⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴))
127, 11bitri 182 . . . . . . . 8 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴))
1312anbi2i 444 . . . . . . 7 ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ (𝑠𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴)))
14 anass 393 . . . . . . 7 (((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴) ↔ (𝑠𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴)))
1513, 14bitr4i 185 . . . . . 6 ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
1615exbii 1536 . . . . 5 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
17 19.41v 1823 . . . . 5 (∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
1816, 17bitri 182 . . . 4 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
194, 5, 183bitr4ri 211 . . 3 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ 𝑡 ∈ ((𝐹𝐵) ∩ 𝐴))
202, 19bitri 182 . 2 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ 𝑡 ∈ ((𝐹𝐵) ∩ 𝐴))
2120eqriv 2078 1 ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)
Colors of variables: wff set class
Syntax hints:  wa 102   = wceq 1284  wex 1421  wcel 1433  cin 2972  cop 3401  ccnv 4362  cres 4365  cima 4366
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-cnv 4371  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator