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

Theorem dffun4f 5228
Description: Definition of function like dffun4 5223 but using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Jim Kingdon, 17-Mar-2019.)
Hypotheses
Ref Expression
dffun4f.1 𝑥𝐴
dffun4f.2 𝑦𝐴
dffun4f.3 𝑧𝐴
Assertion
Ref Expression
dffun4f (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧)))
Distinct variable group:   𝑥,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)

Proof of Theorem dffun4f
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 dffun4f.1 . . 3 𝑥𝐴
2 dffun4f.2 . . 3 𝑦𝐴
31, 2dffun6f 5225 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
4 nfcv 2319 . . . . . . 7 𝑦𝑥
5 nfcv 2319 . . . . . . 7 𝑦𝑤
64, 2, 5nfbr 4046 . . . . . 6 𝑦 𝑥𝐴𝑤
7 breq2 4004 . . . . . 6 (𝑦 = 𝑤 → (𝑥𝐴𝑦𝑥𝐴𝑤))
86, 7mo4f 2086 . . . . 5 (∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑦𝑤((𝑥𝐴𝑦𝑥𝐴𝑤) → 𝑦 = 𝑤))
9 nfv 1528 . . . . . . 7 𝑤((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧)
10 nfcv 2319 . . . . . . . . . 10 𝑧𝑥
11 dffun4f.3 . . . . . . . . . 10 𝑧𝐴
12 nfcv 2319 . . . . . . . . . 10 𝑧𝑦
1310, 11, 12nfbr 4046 . . . . . . . . 9 𝑧 𝑥𝐴𝑦
14 nfcv 2319 . . . . . . . . . 10 𝑧𝑤
1510, 11, 14nfbr 4046 . . . . . . . . 9 𝑧 𝑥𝐴𝑤
1613, 15nfan 1565 . . . . . . . 8 𝑧(𝑥𝐴𝑦𝑥𝐴𝑤)
17 nfv 1528 . . . . . . . 8 𝑧 𝑦 = 𝑤
1816, 17nfim 1572 . . . . . . 7 𝑧((𝑥𝐴𝑦𝑥𝐴𝑤) → 𝑦 = 𝑤)
19 breq2 4004 . . . . . . . . 9 (𝑧 = 𝑤 → (𝑥𝐴𝑧𝑥𝐴𝑤))
2019anbi2d 464 . . . . . . . 8 (𝑧 = 𝑤 → ((𝑥𝐴𝑦𝑥𝐴𝑧) ↔ (𝑥𝐴𝑦𝑥𝐴𝑤)))
21 equequ2 1713 . . . . . . . 8 (𝑧 = 𝑤 → (𝑦 = 𝑧𝑦 = 𝑤))
2220, 21imbi12d 234 . . . . . . 7 (𝑧 = 𝑤 → (((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐴𝑦𝑥𝐴𝑤) → 𝑦 = 𝑤)))
239, 18, 22cbval 1754 . . . . . 6 (∀𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ∀𝑤((𝑥𝐴𝑦𝑥𝐴𝑤) → 𝑦 = 𝑤))
2423albii 1470 . . . . 5 (∀𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ∀𝑦𝑤((𝑥𝐴𝑦𝑥𝐴𝑤) → 𝑦 = 𝑤))
258, 24bitr4i 187 . . . 4 (∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧))
2625albii 1470 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧))
2726anbi2i 457 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧)))
28 df-br 4001 . . . . . . 7 (𝑥𝐴𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴)
29 df-br 4001 . . . . . . 7 (𝑥𝐴𝑧 ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐴)
3028, 29anbi12i 460 . . . . . 6 ((𝑥𝐴𝑦𝑥𝐴𝑧) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
3130imbi1i 238 . . . . 5 (((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧))
32312albii 1471 . . . 4 (∀𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ∀𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧))
3332albii 1470 . . 3 (∀𝑥𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧) ↔ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧))
3433anbi2i 457 . 2 ((Rel 𝐴 ∧ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝑥𝐴𝑧) → 𝑦 = 𝑧)) ↔ (Rel 𝐴 ∧ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧)))
353, 27, 343bitri 206 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥𝑦𝑧((⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) → 𝑦 = 𝑧)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1351  ∃*wmo 2027  wcel 2148  wnfc 2306  cop 3594   class class class wbr 4000  Rel wrel 4628  Fun wfun 5206
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-br 4001  df-opab 4062  df-id 4290  df-cnv 4631  df-co 4632  df-fun 5214
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator