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

Theorem foeqcnvco 7294
Description: Condition for function equality in terms of vanishing of the composition with the converse. EDITORIAL: Is there a relation-algebraic proof of this? (Contributed by Stefan O'Rear, 12-Feb-2015.)
Assertion
Ref Expression
foeqcnvco ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐵)))

Proof of Theorem foeqcnvco
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fococnv2 6853 . . . 4 (𝐹:𝐴onto𝐵 → (𝐹𝐹) = ( I ↾ 𝐵))
2 cnveq 5867 . . . . . 6 (𝐹 = 𝐺𝐹 = 𝐺)
32coeq2d 5856 . . . . 5 (𝐹 = 𝐺 → (𝐹𝐹) = (𝐹𝐺))
43eqeq1d 2728 . . . 4 (𝐹 = 𝐺 → ((𝐹𝐹) = ( I ↾ 𝐵) ↔ (𝐹𝐺) = ( I ↾ 𝐵)))
51, 4syl5ibcom 244 . . 3 (𝐹:𝐴onto𝐵 → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐵)))
65adantr 480 . 2 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐵)))
7 fofn 6801 . . . . 5 (𝐹:𝐴onto𝐵𝐹 Fn 𝐴)
87ad2antrr 723 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐹 Fn 𝐴)
9 fofn 6801 . . . . 5 (𝐺:𝐴onto𝐵𝐺 Fn 𝐴)
109ad2antlr 724 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐺 Fn 𝐴)
119adantl 481 . . . . . . . . . . . 12 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐺 Fn 𝐴)
12 fnopfv 7071 . . . . . . . . . . . 12 ((𝐺 Fn 𝐴𝑥𝐴) → ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1311, 12sylan 579 . . . . . . . . . . 11 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
14 fvex 6898 . . . . . . . . . . . . 13 (𝐺𝑥) ∈ V
15 vex 3472 . . . . . . . . . . . . 13 𝑥 ∈ V
1614, 15brcnv 5876 . . . . . . . . . . . 12 ((𝐺𝑥)𝐺𝑥𝑥𝐺(𝐺𝑥))
17 df-br 5142 . . . . . . . . . . . 12 (𝑥𝐺(𝐺𝑥) ↔ ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1816, 17bitri 275 . . . . . . . . . . 11 ((𝐺𝑥)𝐺𝑥 ↔ ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1913, 18sylibr 233 . . . . . . . . . 10 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥)𝐺𝑥)
207adantr 480 . . . . . . . . . . . 12 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐹 Fn 𝐴)
21 fnopfv 7071 . . . . . . . . . . . 12 ((𝐹 Fn 𝐴𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
2220, 21sylan 579 . . . . . . . . . . 11 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
23 df-br 5142 . . . . . . . . . . 11 (𝑥𝐹(𝐹𝑥) ↔ ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
2422, 23sylibr 233 . . . . . . . . . 10 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → 𝑥𝐹(𝐹𝑥))
25 breq2 5145 . . . . . . . . . . . 12 (𝑦 = 𝑥 → ((𝐺𝑥)𝐺𝑦 ↔ (𝐺𝑥)𝐺𝑥))
26 breq1 5144 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑦𝐹(𝐹𝑥) ↔ 𝑥𝐹(𝐹𝑥)))
2725, 26anbi12d 630 . . . . . . . . . . 11 (𝑦 = 𝑥 → (((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)) ↔ ((𝐺𝑥)𝐺𝑥𝑥𝐹(𝐹𝑥))))
2815, 27spcev 3590 . . . . . . . . . 10 (((𝐺𝑥)𝐺𝑥𝑥𝐹(𝐹𝑥)) → ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
2919, 24, 28syl2anc 583 . . . . . . . . 9 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
30 fvex 6898 . . . . . . . . . 10 (𝐹𝑥) ∈ V
3114, 30brco 5864 . . . . . . . . 9 ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
3229, 31sylibr 233 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥)(𝐹𝐺)(𝐹𝑥))
3332adantlr 712 . . . . . . 7 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥)(𝐹𝐺)(𝐹𝑥))
34 breq 5143 . . . . . . . 8 ((𝐹𝐺) = ( I ↾ 𝐵) → ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥)))
3534ad2antlr 724 . . . . . . 7 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥)))
3633, 35mpbid 231 . . . . . 6 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥))
37 fof 6799 . . . . . . . . . 10 (𝐺:𝐴onto𝐵𝐺:𝐴𝐵)
3837adantl 481 . . . . . . . . 9 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐺:𝐴𝐵)
3938ffvelcdmda 7080 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥) ∈ 𝐵)
40 fof 6799 . . . . . . . . . 10 (𝐹:𝐴onto𝐵𝐹:𝐴𝐵)
4140adantr 480 . . . . . . . . 9 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐹:𝐴𝐵)
4241ffvelcdmda 7080 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
43 resieq 5986 . . . . . . . 8 (((𝐺𝑥) ∈ 𝐵 ∧ (𝐹𝑥) ∈ 𝐵) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4439, 42, 43syl2anc 583 . . . . . . 7 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4544adantlr 712 . . . . . 6 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4636, 45mpbid 231 . . . . 5 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥) = (𝐹𝑥))
4746eqcomd 2732 . . . 4 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐹𝑥) = (𝐺𝑥))
488, 10, 47eqfnfvd 7029 . . 3 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐹 = 𝐺)
4948ex 412 . 2 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → ((𝐹𝐺) = ( I ↾ 𝐵) → 𝐹 = 𝐺))
506, 49impbid 211 1 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1533  wex 1773  wcel 2098  cop 4629   class class class wbr 5141   I cid 5566  ccnv 5668  cres 5671  ccom 5673   Fn wfn 6532  wf 6533  ontowfo 6535  cfv 6537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator