| 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 8853 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} ∈ V | |
| 2 | f1ofo 6828 | . . 3 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴–onto→𝐵) | |
| 3 | 2 | ss2abi 4019 | . 2 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ⊆ {𝑓 ∣ 𝑓:𝐴–onto→𝐵} |
| 4 | 1, 3 | ssexi 5292 | 1 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐵} ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2142 {cab 2740 Vcvv 3454 –onto→wfo 6534 –1-1-onto→wf1o 6535 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8824 |
| This theorem is used by: hashfacen 14498 symgplusg 19459 symgvalstruct 19473 |
| Copyright terms: Public domain | W3C validator |