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 8677 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} ∈ V | |
2 | f1ofo 6753 | . . 3 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴–onto→𝐵) | |
3 | 2 | ss2abi 4005 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ⊆ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} |
4 | 1, 3 | ssexi 5255 | 1 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2104 {cab 2713 Vcvv 3437 –onto→wfo 6456 –1-1-onto→wf1o 6457 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3306 df-v 3439 df-sbc 3722 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-id 5500 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-map 8648 |
This theorem is referenced by: hashfacen 14215 symgplusg 19039 symgvalstruct 19053 symgvalstructOLD 19054 |
Copyright terms: Public domain | W3C validator |