| 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 6431 | . . . 4 ⊢ (Rel 𝐴 → (𝐹 Fn 𝐴 → tpos 𝐹 Fn ◡𝐴)) | |
| 2 | 1 | adantrd 279 | . . 3 ⊢ (Rel 𝐴 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → tpos 𝐹 Fn ◡𝐴)) |
| 3 | fndm 5429 | . . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 4 | 3 | releqd 4810 | . . . . . . . 8 ⊢ (𝐹 Fn 𝐴 → (Rel dom 𝐹 ↔ Rel 𝐴)) |
| 5 | 4 | biimparc 299 | . . . . . . 7 ⊢ ((Rel 𝐴 ∧ 𝐹 Fn 𝐴) → Rel dom 𝐹) |
| 6 | rntpos 6422 | . . . . . . 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 5332 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) | |
| 13 | df-fo 5332 | . 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 1397 ◡ccnv 4724 dom cdm 4725 ran crn 4726 Rel wrel 4730 Fn wfn 5321 –onto→wfo 5324 tpos ctpos 6409 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-fo 5332 df-fv 5334 df-tpos 6410 |
| This theorem is referenced by: tposf2 6433 tposf1o2 6435 tposfo 6436 |
| Copyright terms: Public domain | W3C validator |