| 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 6475 | . . . 4 ⊢ (Rel 𝐴 → (𝐹 Fn 𝐴 → tpos 𝐹 Fn ◡𝐴)) | |
| 2 | 1 | adantrd 279 | . . 3 ⊢ (Rel 𝐴 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → tpos 𝐹 Fn ◡𝐴)) |
| 3 | fndm 5436 | . . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 4 | 3 | releqd 4816 | . . . . . . . 8 ⊢ (𝐹 Fn 𝐴 → (Rel dom 𝐹 ↔ Rel 𝐴)) |
| 5 | 4 | biimparc 299 | . . . . . . 7 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → Rel dom 𝐹) |
| 6 | rntpos 6466 | . . . . . . 7 ⊢ (Rel dom 𝐹 → ran tpos 𝐹 = ran 𝐹) | |
| 7 | 5, 6 | syl 14 | . . . . . 6 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → ran tpos 𝐹 = ran 𝐹) |
| 8 | 7 | eqeq1d 2240 | . . . . 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 5339 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) | |
| 13 | df-fo 5339 | . 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 1398 ◡ccnv 4730 dom cdm 4731 ran crn 4732 Rel wrel 4736 Fn wfn 5328 –onto→wfo 5331 tpos ctpos 6453 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-fo 5339 df-fv 5341 df-tpos 6454 |
| This theorem is referenced by: tposf2 6477 tposf1o2 6479 tposfo 6480 |
| Copyright terms: Public domain | W3C validator |