![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fsng | GIF version |
Description: A function maps a singleton to a singleton iff it is the singleton of an ordered pair. (Contributed by NM, 26-Oct-2012.) |
Ref | Expression |
---|---|
fsng | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {〈𝐴, 𝐵〉})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sneq 3485 | . . . 4 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
2 | 1 | feq2d 5196 | . . 3 ⊢ (𝑎 = 𝐴 → (𝐹:{𝑎}⟶{𝑏} ↔ 𝐹:{𝐴}⟶{𝑏})) |
3 | opeq1 3652 | . . . . 5 ⊢ (𝑎 = 𝐴 → 〈𝑎, 𝑏〉 = 〈𝐴, 𝑏〉) | |
4 | 3 | sneqd 3487 | . . . 4 ⊢ (𝑎 = 𝐴 → {〈𝑎, 𝑏〉} = {〈𝐴, 𝑏〉}) |
5 | 4 | eqeq2d 2111 | . . 3 ⊢ (𝑎 = 𝐴 → (𝐹 = {〈𝑎, 𝑏〉} ↔ 𝐹 = {〈𝐴, 𝑏〉})) |
6 | 2, 5 | bibi12d 234 | . 2 ⊢ (𝑎 = 𝐴 → ((𝐹:{𝑎}⟶{𝑏} ↔ 𝐹 = {〈𝑎, 𝑏〉}) ↔ (𝐹:{𝐴}⟶{𝑏} ↔ 𝐹 = {〈𝐴, 𝑏〉}))) |
7 | sneq 3485 | . . . 4 ⊢ (𝑏 = 𝐵 → {𝑏} = {𝐵}) | |
8 | feq3 5193 | . . . 4 ⊢ ({𝑏} = {𝐵} → (𝐹:{𝐴}⟶{𝑏} ↔ 𝐹:{𝐴}⟶{𝐵})) | |
9 | 7, 8 | syl 14 | . . 3 ⊢ (𝑏 = 𝐵 → (𝐹:{𝐴}⟶{𝑏} ↔ 𝐹:{𝐴}⟶{𝐵})) |
10 | opeq2 3653 | . . . . 5 ⊢ (𝑏 = 𝐵 → 〈𝐴, 𝑏〉 = 〈𝐴, 𝐵〉) | |
11 | 10 | sneqd 3487 | . . . 4 ⊢ (𝑏 = 𝐵 → {〈𝐴, 𝑏〉} = {〈𝐴, 𝐵〉}) |
12 | 11 | eqeq2d 2111 | . . 3 ⊢ (𝑏 = 𝐵 → (𝐹 = {〈𝐴, 𝑏〉} ↔ 𝐹 = {〈𝐴, 𝐵〉})) |
13 | 9, 12 | bibi12d 234 | . 2 ⊢ (𝑏 = 𝐵 → ((𝐹:{𝐴}⟶{𝑏} ↔ 𝐹 = {〈𝐴, 𝑏〉}) ↔ (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {〈𝐴, 𝐵〉}))) |
14 | vex 2644 | . . 3 ⊢ 𝑎 ∈ V | |
15 | vex 2644 | . . 3 ⊢ 𝑏 ∈ V | |
16 | 14, 15 | fsn 5524 | . 2 ⊢ (𝐹:{𝑎}⟶{𝑏} ↔ 𝐹 = {〈𝑎, 𝑏〉}) |
17 | 6, 13, 16 | vtocl2g 2705 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {〈𝐴, 𝐵〉})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1299 ∈ wcel 1448 {csn 3474 〈cop 3477 ⟶wf 5055 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 671 ax-5 1391 ax-7 1392 ax-gen 1393 ax-ie1 1437 ax-ie2 1438 ax-8 1450 ax-10 1451 ax-11 1452 ax-i12 1453 ax-bndl 1454 ax-4 1455 ax-14 1460 ax-17 1474 ax-i9 1478 ax-ial 1482 ax-i5r 1483 ax-ext 2082 ax-sep 3986 ax-pow 4038 ax-pr 4069 |
This theorem depends on definitions: df-bi 116 df-3an 932 df-tru 1302 df-nf 1405 df-sb 1704 df-eu 1963 df-mo 1964 df-clab 2087 df-cleq 2093 df-clel 2096 df-nfc 2229 df-ral 2380 df-rex 2381 df-reu 2382 df-v 2643 df-un 3025 df-in 3027 df-ss 3034 df-pw 3459 df-sn 3480 df-pr 3481 df-op 3483 df-br 3876 df-opab 3930 df-id 4153 df-xp 4483 df-rel 4484 df-cnv 4485 df-co 4486 df-dm 4487 df-rn 4488 df-fun 5061 df-fn 5062 df-f 5063 df-f1 5064 df-fo 5065 df-f1o 5066 |
This theorem is referenced by: fsn2 5526 xpsng 5527 ftpg 5536 fseq1p1m1 9715 |
Copyright terms: Public domain | W3C validator |