| 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 8858 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} ∈ V | |
| 2 | f1ofo 6820 | . . 3 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴–onto→𝐵) | |
| 3 | 2 | ss2abi 4013 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ⊆ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} |
| 4 | 1, 3 | ssexi 5283 | 1 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 {cab 2738 Vcvv 3450 –onto→wfo 6525 –1-1-onto→wf1o 6526 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-map 8827 |
| This theorem is used by: hashfacen 14566 symgplusg 19558 symgvalstruct 19572 |
| Copyright terms: Public domain | W3C validator |