| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tposfo2 | GIF version | ||
| Description: Condition for a surjective transposition. (Contributed by NM, 10-Sep-2015.) |
| Ref | Expression |
|---|---|
| tposfo2 | ⊢ (Rel 𝐴 → (𝐹:𝐴–onto→𝐵 → tpos 𝐹:◡𝐴–onto→𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tposfn2 6377 | . . . 4 ⊢ (Rel 𝐴 → (𝐹 Fn 𝐴 → tpos 𝐹 Fn ◡𝐴)) | |
| 2 | 1 | adantrd 279 | . . 3 ⊢ (Rel 𝐴 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → tpos 𝐹 Fn ◡𝐴)) |
| 3 | fndm 5393 | . . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 4 | 3 | releqd 4778 | . . . . . . . 8 ⊢ (𝐹 Fn 𝐴 → (Rel dom 𝐹 ↔ Rel 𝐴)) |
| 5 | 4 | biimparc 299 | . . . . . . 7 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → Rel dom 𝐹) |
| 6 | rntpos 6368 | . . . . . . 7 ⊢ (Rel dom 𝐹 → ran tpos 𝐹 = ran 𝐹) | |
| 7 | 5, 6 | syl 14 | . . . . . 6 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → ran tpos 𝐹 = ran 𝐹) |
| 8 | 7 | eqeq1d 2216 | . . . . 5 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → (ran tpos 𝐹 = 𝐵 ↔ ran 𝐹 = 𝐵)) |
| 9 | 8 | biimprd 158 | . . . 4 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → (ran 𝐹 = 𝐵 → ran tpos 𝐹 = 𝐵)) |
| 10 | 9 | expimpd 363 | . . 3 ⊢ (Rel 𝐴 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → ran tpos 𝐹 = 𝐵)) |
| 11 | 2, 10 | jcad 307 | . 2 ⊢ (Rel 𝐴 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → (tpos 𝐹 Fn ◡𝐴 ∧ ran tpos 𝐹 = 𝐵))) |
| 12 | df-fo 5297 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) | |
| 13 | df-fo 5297 | . 2 ⊢ (tpos 𝐹:◡𝐴–onto→𝐵 ↔ (tpos 𝐹 Fn ◡𝐴 ∧ ran tpos 𝐹 = 𝐵)) | |
| 14 | 11, 12, 13 | 3imtr4g 205 | 1 ⊢ (Rel 𝐴 → (𝐹:𝐴–onto→𝐵 → tpos 𝐹:◡𝐴–onto→𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ◡ccnv 4693 dom cdm 4694 ran crn 4695 Rel wrel 4699 Fn wfn 5286 –onto→wfo 5289 tpos ctpos 6355 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4179 ax-nul 4187 ax-pow 4235 ax-pr 4270 ax-un 4499 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-rab 2495 df-v 2779 df-sbc 3007 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-nul 3470 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-br 4061 df-opab 4123 df-mpt 4124 df-id 4359 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-ima 4707 df-iota 5252 df-fun 5293 df-fn 5294 df-fo 5297 df-fv 5299 df-tpos 6356 |
| This theorem is referenced by: tposf2 6379 tposf1o2 6381 tposfo 6382 |
| Copyright terms: Public domain | W3C validator |