| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1osetex | Structured version Visualization version GIF version | ||
| Description: The set of bijections between two classes exists. (Contributed by AV, 30-Mar-2024.) (Revised by AV, 8-Aug-2024.) (Proof shortened by SN, 22-Aug-2024.) |
| Ref | Expression |
|---|---|
| f1osetex | ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fosetex 8794 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} ∈ V | |
| 2 | f1ofo 6776 | . . 3 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴–onto→𝐵) | |
| 3 | 2 | ss2abi 3999 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ⊆ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} |
| 4 | 1, 3 | ssexi 5252 | 1 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 {cab 2713 Vcvv 3427 –onto→wfo 6485 –1-1-onto→wf1o 6486 |
| 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 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-rab 3388 df-v 3429 df-sbc 3726 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-br 5075 df-opab 5137 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8764 |
| This theorem is referenced by: hashfacen 14405 symgplusg 19347 symgvalstruct 19361 |
| Copyright terms: Public domain | W3C validator |