| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djulf1o | Structured version Visualization version GIF version | ||
| Description: The left injection function on all sets is one to one and onto. (Contributed by Jim Kingdon, 22-Jun-2022.) |
| Ref | Expression |
|---|---|
| djulf1o | ⊢ inl:V–1-1-onto→({∅} × V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-inl 9826 | . . 3 ⊢ inl = (𝑥 ∈ V ↦ 〈∅, 𝑥〉) | |
| 2 | 0ex 5254 | . . . . . 6 ⊢ ∅ ∈ V | |
| 3 | 2 | snid 4621 | . . . . 5 ⊢ ∅ ∈ {∅} |
| 4 | opelxpi 5669 | . . . . 5 ⊢ ((∅ ∈ {∅} ∧ 𝑥 ∈ V) → 〈∅, 𝑥〉 ∈ ({∅} × V)) | |
| 5 | 3, 4 | mpan 691 | . . . 4 ⊢ (𝑥 ∈ V → 〈∅, 𝑥〉 ∈ ({∅} × V)) |
| 6 | 5 | adantl 481 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ V) → 〈∅, 𝑥〉 ∈ ({∅} × V)) |
| 7 | fvexd 6857 | . . 3 ⊢ ((⊤ ∧ 𝑦 ∈ ({∅} × V)) → (2nd ‘𝑦) ∈ V) | |
| 8 | 1st2nd2 7982 | . . . . . . . 8 ⊢ (𝑦 ∈ ({∅} × V) → 𝑦 = 〈(1st ‘𝑦), (2nd ‘𝑦)〉) | |
| 9 | xp1st 7975 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) ∈ {∅}) | |
| 10 | elsni 4599 | . . . . . . . . . 10 ⊢ ((1st ‘𝑦) ∈ {∅} → (1st ‘𝑦) = ∅) | |
| 11 | 9, 10 | syl 17 | . . . . . . . . 9 ⊢ (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) = ∅) |
| 12 | 11 | opeq1d 4837 | . . . . . . . 8 ⊢ (𝑦 ∈ ({∅} × V) → 〈(1st ‘𝑦), (2nd ‘𝑦)〉 = 〈∅, (2nd ‘𝑦)〉) |
| 13 | 8, 12 | eqtrd 2772 | . . . . . . 7 ⊢ (𝑦 ∈ ({∅} × V) → 𝑦 = 〈∅, (2nd ‘𝑦)〉) |
| 14 | 13 | eqeq2d 2748 | . . . . . 6 ⊢ (𝑦 ∈ ({∅} × V) → (〈∅, 𝑥〉 = 𝑦 ↔ 〈∅, 𝑥〉 = 〈∅, (2nd ‘𝑦)〉)) |
| 15 | eqcom 2744 | . . . . . 6 ⊢ (〈∅, 𝑥〉 = 𝑦 ↔ 𝑦 = 〈∅, 𝑥〉) | |
| 16 | eqid 2737 | . . . . . . 7 ⊢ ∅ = ∅ | |
| 17 | vex 3446 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 18 | 2, 17 | opth 5432 | . . . . . . 7 ⊢ (〈∅, 𝑥〉 = 〈∅, (2nd ‘𝑦)〉 ↔ (∅ = ∅ ∧ 𝑥 = (2nd ‘𝑦))) |
| 19 | 16, 18 | mpbiran 710 | . . . . . 6 ⊢ (〈∅, 𝑥〉 = 〈∅, (2nd ‘𝑦)〉 ↔ 𝑥 = (2nd ‘𝑦)) |
| 20 | 14, 15, 19 | 3bitr3g 313 | . . . . 5 ⊢ (𝑦 ∈ ({∅} × V) → (𝑦 = 〈∅, 𝑥〉 ↔ 𝑥 = (2nd ‘𝑦))) |
| 21 | 20 | bicomd 223 | . . . 4 ⊢ (𝑦 ∈ ({∅} × V) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = 〈∅, 𝑥〉)) |
| 22 | 21 | ad2antll 730 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ V ∧ 𝑦 ∈ ({∅} × V))) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = 〈∅, 𝑥〉)) |
| 23 | 1, 6, 7, 22 | f1o2d 7622 | . 2 ⊢ (⊤ → inl:V–1-1-onto→({∅} × V)) |
| 24 | 23 | mptru 1549 | 1 ⊢ inl:V–1-1-onto→({∅} × V) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ⊤wtru 1543 ∈ wcel 2114 Vcvv 3442 ∅c0 4287 {csn 4582 〈cop 4588 × cxp 5630 –1-1-onto→wf1o 6499 ‘cfv 6500 1st c1st 7941 2nd c2nd 7942 inlcinl 9823 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 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-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-1st 7943 df-2nd 7944 df-inl 9826 |
| This theorem is referenced by: inlresf 9838 inlresf1 9839 djuin 9842 djuun 9850 |
| Copyright terms: Public domain | W3C validator |