| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > funcnvsn | GIF version | ||
| Description: The converse singleton of an ordered pair is a function. This is equivalent to funsn 5306 via cnvsn 5152, but stating it this way allows us to skip the sethood assumptions on 𝐴 and 𝐵. (Contributed by NM, 30-Apr-2015.) |
| Ref | Expression |
|---|---|
| funcnvsn | ⊢ Fun ◡{〈𝐴, 𝐵〉} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 5047 | . 2 ⊢ Rel ◡{〈𝐴, 𝐵〉} | |
| 2 | moeq 2939 | . . . 4 ⊢ ∃*𝑦 𝑦 = 𝐴 | |
| 3 | vex 2766 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 4 | vex 2766 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 5 | 3, 4 | brcnv 4849 | . . . . . . 7 ⊢ (𝑥◡{〈𝐴, 𝐵〉}𝑦 ↔ 𝑦{〈𝐴, 𝐵〉}𝑥) |
| 6 | df-br 4034 | . . . . . . 7 ⊢ (𝑦{〈𝐴, 𝐵〉}𝑥 ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉}) | |
| 7 | 5, 6 | bitri 184 | . . . . . 6 ⊢ (𝑥◡{〈𝐴, 𝐵〉}𝑦 ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉}) |
| 8 | elsni 3640 | . . . . . . 7 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉} → 〈𝑦, 𝑥〉 = 〈𝐴, 𝐵〉) | |
| 9 | 4, 3 | opth1 4269 | . . . . . . 7 ⊢ (〈𝑦, 𝑥〉 = 〈𝐴, 𝐵〉 → 𝑦 = 𝐴) |
| 10 | 8, 9 | syl 14 | . . . . . 6 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉} → 𝑦 = 𝐴) |
| 11 | 7, 10 | sylbi 121 | . . . . 5 ⊢ (𝑥◡{〈𝐴, 𝐵〉}𝑦 → 𝑦 = 𝐴) |
| 12 | 11 | moimi 2110 | . . . 4 ⊢ (∃*𝑦 𝑦 = 𝐴 → ∃*𝑦 𝑥◡{〈𝐴, 𝐵〉}𝑦) |
| 13 | 2, 12 | ax-mp 5 | . . 3 ⊢ ∃*𝑦 𝑥◡{〈𝐴, 𝐵〉}𝑦 |
| 14 | 13 | ax-gen 1463 | . 2 ⊢ ∀𝑥∃*𝑦 𝑥◡{〈𝐴, 𝐵〉}𝑦 |
| 15 | dffun6 5272 | . 2 ⊢ (Fun ◡{〈𝐴, 𝐵〉} ↔ (Rel ◡{〈𝐴, 𝐵〉} ∧ ∀𝑥∃*𝑦 𝑥◡{〈𝐴, 𝐵〉}𝑦)) | |
| 16 | 1, 14, 15 | mpbir2an 944 | 1 ⊢ Fun ◡{〈𝐴, 𝐵〉} |
| Colors of variables: wff set class |
| Syntax hints: ∀wal 1362 = wceq 1364 ∃*wmo 2046 ∈ wcel 2167 {csn 3622 〈cop 3625 class class class wbr 4033 ◡ccnv 4662 Rel wrel 4668 Fun wfun 5252 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-br 4034 df-opab 4095 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-fun 5260 |
| This theorem is referenced by: funsng 5304 |
| Copyright terms: Public domain | W3C validator |