Theorem dffun10 36270

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.

Step	Hyp	Ref	Expression
1		impexp 455	. . . . . . 7 ⊢ (((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
2	1	albii 1842	. . . . . 6 ⊢ (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
3		19.21v 1962	. . . . . 6 ⊢ (∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
4		vex 3461	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
5		vex 3461	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
6	4, 5	opelco 5847	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ∃𝑧(𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦))
7		df-br 5105	. . . . . . . . . . . 12 ⊢ (𝑥𝐹𝑧 ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐹)
8		brv 5444	. . . . . . . . . . . . . 14 ⊢ 𝑧V𝑦
9		brdif 5157	. . . . . . . . . . . . . 14 ⊢ (𝑧(V ∖ I )𝑦 ↔ (𝑧V𝑦 ∧ ¬ 𝑧 I 𝑦))
10	8, 9	mpbiran 721	. . . . . . . . . . . . 13 ⊢ (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑧 I 𝑦)
11	5	ideq 5828	. . . . . . . . . . . . . 14 ⊢ (𝑧 I 𝑦 ↔ 𝑧 = 𝑦)
12		equcom 2041	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑦 ↔ 𝑦 = 𝑧)
13	11, 12	bitri 278	. . . . . . . . . . . . 13 ⊢ (𝑧 I 𝑦 ↔ 𝑦 = 𝑧)
14	10, 13	xchbinx 337	. . . . . . . . . . . 12 ⊢ (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑦 = 𝑧)
15	7, 14	anbi12i 639	. . . . . . . . . . 11 ⊢ ((𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦) ↔ (⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
16	15	exbii 1871	. . . . . . . . . 10 ⊢ (∃𝑧(𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦) ↔ ∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
17		exanali 1882	. . . . . . . . . 10 ⊢ (∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧))
18	6, 16, 17	3bitri 300	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧))
19	18	con2bii 360	. . . . . . . 8 ⊢ (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
20		opex 5435	. . . . . . . . 9 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
21		eldif 3917	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹)))
22	20, 21	mpbiran 721	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
23	19, 22	bitr4i 281	. . . . . . 7 ⊢ (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧) ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))
24	23	imbi2i 339	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
25	2, 3, 24	3bitri 300	. . . . 5 ⊢ (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
26	25	2albii 1843	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
27		ssrel 5759	. . . 4 ⊢ (Rel 𝐹 → (𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))))
28	26, 27	bitr4id 293	. . 3 ⊢ (Rel 𝐹 → (∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
29	28	pm5.32i 584	. 2 ⊢ ((Rel 𝐹 ∧ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)) ↔ (Rel 𝐹 ∧ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
30		dffun4 6538	. 2 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)))
31		sscoid 36269	. 2 ⊢ (𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))) ↔ (Rel 𝐹 ∧ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
32	29, 30, 31	3bitr4i 306	1 ⊢ (Fun 𝐹 ↔ 𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1561  ∃wex 1802   ∈ wcel 2145  Vcvv 3457   ∖ cdif 3904   ⊆ wss 3907  ⟨cop 4591   class class class wbr 5104   I cid 5545   ∘ ccom 5655  Rel wrel 5656  Fun wfun 6519

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5250  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5105  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-fun 6527

This theorem is referenced by: (None)