Theorem dffun10 36128

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 450	. . . . . . 7 ⊢ (((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
2	1	albii 1821	. . . . . 6 ⊢ (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
3		19.21v 1941	. . . . . 6 ⊢ (∀𝑧(⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)))
4		vex 3446	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
5		vex 3446	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
6	4, 5	opelco 5828	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ∃𝑧(𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦))
7		df-br 5101	. . . . . . . . . . . 12 ⊢ (𝑥𝐹𝑧 ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐹)
8		brv 5428	. . . . . . . . . . . . . 14 ⊢ 𝑧V𝑦
9		brdif 5153	. . . . . . . . . . . . . 14 ⊢ (𝑧(V ∖ I )𝑦 ↔ (𝑧V𝑦 ∧ ¬ 𝑧 I 𝑦))
10	8, 9	mpbiran 710	. . . . . . . . . . . . 13 ⊢ (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑧 I 𝑦)
11	5	ideq 5809	. . . . . . . . . . . . . 14 ⊢ (𝑧 I 𝑦 ↔ 𝑧 = 𝑦)
12		equcom 2020	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑦 ↔ 𝑦 = 𝑧)
13	11, 12	bitri 275	. . . . . . . . . . . . 13 ⊢ (𝑧 I 𝑦 ↔ 𝑦 = 𝑧)
14	10, 13	xchbinx 334	. . . . . . . . . . . 12 ⊢ (𝑧(V ∖ I )𝑦 ↔ ¬ 𝑦 = 𝑧)
15	7, 14	anbi12i 629	. . . . . . . . . . 11 ⊢ ((𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦) ↔ (⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
16	15	exbii 1850	. . . . . . . . . 10 ⊢ (∃𝑧(𝑥𝐹𝑧 ∧ 𝑧(V ∖ I )𝑦) ↔ ∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧))
17		exanali 1861	. . . . . . . . . 10 ⊢ (∃𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 ∧ ¬ 𝑦 = 𝑧) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧))
18	6, 16, 17	3bitri 297	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹) ↔ ¬ ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧))
19	18	con2bii 357	. . . . . . . 8 ⊢ (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
20		opex 5419	. . . . . . . . 9 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
21		eldif 3913	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹)))
22	20, 21	mpbiran 710	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ ((V ∖ I ) ∘ 𝐹))
23	19, 22	bitr4i 278	. . . . . . 7 ⊢ (∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧) ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))
24	23	imbi2i 336	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ 𝐹 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑦 = 𝑧)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
25	2, 3, 24	3bitri 297	. . . . 5 ⊢ (∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
26	25	2albii 1822	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹))))
27		ssrel 5740	. . . 4 ⊢ (Rel 𝐹 → (𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹)) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ (V ∖ ((V ∖ I ) ∘ 𝐹)))))
28	26, 27	bitr4id 290	. . 3 ⊢ (Rel 𝐹 → (∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧) ↔ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
29	28	pm5.32i 574	. 2 ⊢ ((Rel 𝐹 ∧ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)) ↔ (Rel 𝐹 ∧ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
30		dffun4 6513	. 2 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑦 = 𝑧)))
31		sscoid 36127	. 2 ⊢ (𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))) ↔ (Rel 𝐹 ∧ 𝐹 ⊆ (V ∖ ((V ∖ I ) ∘ 𝐹))))
32	29, 30, 31	3bitr4i 303	1 ⊢ (Fun 𝐹 ↔ 𝐹 ⊆ ( I ∘ (V ∖ ((V ∖ I ) ∘ 𝐹))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540  ∃wex 1781   ∈ wcel 2114  Vcvv 3442   ∖ cdif 3900   ⊆ wss 3903  ⟨cop 4588   class class class wbr 5100   I cid 5526   ∘ ccom 5636  Rel wrel 5637  Fun wfun 6494

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-fun 6502

This theorem is referenced by: (None)