Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tposf1o2 | Structured version Visualization version GIF version |
Description: Condition of a bijective transposition. (Contributed by NM, 10-Sep-2015.) |
Ref | Expression |
---|---|
tposf1o2 | ⊢ (Rel 𝐴 → (𝐹:𝐴–1-1-onto→𝐵 → tpos 𝐹:◡𝐴–1-1-onto→𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tposf12 7917 | . . 3 ⊢ (Rel 𝐴 → (𝐹:𝐴–1-1→𝐵 → tpos 𝐹:◡𝐴–1-1→𝐵)) | |
2 | tposfo2 7915 | . . 3 ⊢ (Rel 𝐴 → (𝐹:𝐴–onto→𝐵 → tpos 𝐹:◡𝐴–onto→𝐵)) | |
3 | 1, 2 | anim12d 610 | . 2 ⊢ (Rel 𝐴 → ((𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵) → (tpos 𝐹:◡𝐴–1-1→𝐵 ∧ tpos 𝐹:◡𝐴–onto→𝐵))) |
4 | df-f1o 6362 | . 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵)) | |
5 | df-f1o 6362 | . 2 ⊢ (tpos 𝐹:◡𝐴–1-1-onto→𝐵 ↔ (tpos 𝐹:◡𝐴–1-1→𝐵 ∧ tpos 𝐹:◡𝐴–onto→𝐵)) | |
6 | 3, 4, 5 | 3imtr4g 298 | 1 ⊢ (Rel 𝐴 → (𝐹:𝐴–1-1-onto→𝐵 → tpos 𝐹:◡𝐴–1-1-onto→𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ◡ccnv 5554 Rel wrel 5560 –1-1→wf1 6352 –onto→wfo 6353 –1-1-onto→wf1o 6354 tpos ctpos 7891 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-1st 7689 df-2nd 7690 df-tpos 7892 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |