Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dffun10 Structured version   Visualization version   GIF version

Theorem dffun10 35895
Description: Another potential definition of functionality. Based on statements in http://people.math.gatech.edu/~belinfan/research/autoreas/otter/sum/fs/. (Contributed by Scott Fenton, 30-Aug-2017.)
Assertion
Ref Expression
dffun10 (Fun 𝐹𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))))

Proof of Theorem dffun10
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 impexp 450 . . . . . . 7 (((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧)))
21albii 1815 . . . . . 6 (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧)))
3 19.21v 1936 . . . . . 6 (∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧)))
4 vex 3481 . . . . . . . . . . 11 𝑥 ∈ V
5 vex 3481 . . . . . . . . . . 11 𝑦 ∈ V
64, 5opelco 5884 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ∃𝑧(𝑥𝐹𝑧𝑧(V ∖ I )𝑦))
7 df-br 5148 . . . . . . . . . . . 12 (𝑥𝐹𝑧 ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐹)
8 brv 5482 . . . . . . . . . . . . . 14 𝑧V𝑦
9 brdif 5200 . . . . . . . . . . . . . 14 (𝑧(V ∖ I )𝑦 ↔ (𝑧V𝑦 ∧ ¬ 𝑧 I 𝑦))
108, 9mpbiran 709 . . . . . . . . . . . . 13 (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑧 I 𝑦)
115ideq 5865 . . . . . . . . . . . . . 14 (𝑧 I 𝑦𝑧 = 𝑦)
12 equcom 2014 . . . . . . . . . . . . . 14 (𝑧 = 𝑦𝑦 = 𝑧)
1311, 12bitri 275 . . . . . . . . . . . . 13 (𝑧 I 𝑦𝑦 = 𝑧)
1410, 13xchbinx 334 . . . . . . . . . . . 12 (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑦 = 𝑧)
157, 14anbi12i 628 . . . . . . . . . . 11 ((𝑥𝐹𝑧𝑧(V ∖ I )𝑦) ↔ (⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
1615exbii 1844 . . . . . . . . . 10 (∃𝑧(𝑥𝐹𝑧𝑧(V ∖ I )𝑦) ↔ ∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
17 exanali 1856 . . . . . . . . . 10 (∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧))
186, 16, 173bitri 297 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧))
1918con2bii 357 . . . . . . . 8 (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
20 opex 5474 . . . . . . . . 9 𝑥, 𝑦⟩ ∈ V
21 eldif 3972 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹)))
2220, 21mpbiran 709 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
2319, 22bitr4i 278 . . . . . . 7 (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧) ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))
2423imbi2i 336 . . . . . 6 ((⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
252, 3, 243bitri 297 . . . . 5 (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
26252albii 1816 . . . 4 (∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
27 ssrel 5794 . . . 4 (Rel 𝐹 → (𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))))
2826, 27bitr4id 290 . . 3 (Rel 𝐹 → (∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
2928pm5.32i 574 . 2 ((Rel 𝐹 ∧ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)) ↔ (Rel 𝐹𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
30 dffun4 6578 . 2 (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)))
31 sscoid 35894 . 2 (𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))) ↔ (Rel 𝐹𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
3229, 30, 313bitr4i 303 1 (Fun 𝐹𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1534  wex 1775  wcel 2105  Vcvv 3477  cdif 3959  wss 3962  cop 4636   class class class wbr 5147   I cid 5581  ccom 5692  Rel wrel 5693  Fun wfun 6556
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-br 5148  df-opab 5210  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-fun 6564
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator