![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > casef1 | GIF version |
Description: The "case" construction of two injective functions with disjoint ranges is an injective function. (Contributed by BJ, 10-Jul-2022.) |
Ref | Expression |
---|---|
casef1.f | ⊢ (𝜑 → 𝐹:𝐴–1-1→𝑋) |
casef1.g | ⊢ (𝜑 → 𝐺:𝐵–1-1→𝑋) |
casef1.disj | ⊢ (𝜑 → (ran 𝐹 ∩ ran 𝐺) = ∅) |
Ref | Expression |
---|---|
casef1 | ⊢ (𝜑 → case(𝐹, 𝐺):(𝐴 ⊔ 𝐵)–1-1→𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | casef1.f | . . . 4 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝑋) | |
2 | f1f 5336 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝑋 → 𝐹:𝐴⟶𝑋) | |
3 | 1, 2 | syl 14 | . . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝑋) |
4 | casef1.g | . . . 4 ⊢ (𝜑 → 𝐺:𝐵–1-1→𝑋) | |
5 | f1f 5336 | . . . 4 ⊢ (𝐺:𝐵–1-1→𝑋 → 𝐺:𝐵⟶𝑋) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝑋) |
7 | 3, 6 | casef 6981 | . 2 ⊢ (𝜑 → case(𝐹, 𝐺):(𝐴 ⊔ 𝐵)⟶𝑋) |
8 | df-f1 5136 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝑋 ↔ (𝐹:𝐴⟶𝑋 ∧ Fun ◡𝐹)) | |
9 | 8 | simprbi 273 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝑋 → Fun ◡𝐹) |
10 | 1, 9 | syl 14 | . . 3 ⊢ (𝜑 → Fun ◡𝐹) |
11 | df-f1 5136 | . . . . 5 ⊢ (𝐺:𝐵–1-1→𝑋 ↔ (𝐺:𝐵⟶𝑋 ∧ Fun ◡𝐺)) | |
12 | 11 | simprbi 273 | . . . 4 ⊢ (𝐺:𝐵–1-1→𝑋 → Fun ◡𝐺) |
13 | 4, 12 | syl 14 | . . 3 ⊢ (𝜑 → Fun ◡𝐺) |
14 | casef1.disj | . . 3 ⊢ (𝜑 → (ran 𝐹 ∩ ran 𝐺) = ∅) | |
15 | 10, 13, 14 | caseinj 6982 | . 2 ⊢ (𝜑 → Fun ◡case(𝐹, 𝐺)) |
16 | df-f1 5136 | . 2 ⊢ (case(𝐹, 𝐺):(𝐴 ⊔ 𝐵)–1-1→𝑋 ↔ (case(𝐹, 𝐺):(𝐴 ⊔ 𝐵)⟶𝑋 ∧ Fun ◡case(𝐹, 𝐺))) | |
17 | 7, 15, 16 | sylanbrc 414 | 1 ⊢ (𝜑 → case(𝐹, 𝐺):(𝐴 ⊔ 𝐵)–1-1→𝑋) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1332 ∩ cin 3075 ∅c0 3368 ◡ccnv 4546 ran crn 4548 Fun wfun 5125 ⟶wf 5127 –1-1→wf1 5128 ⊔ cdju 6930 casecdjucase 6976 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-mpt 3999 df-tr 4035 df-id 4223 df-iord 4296 df-on 4298 df-suc 4301 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-1st 6046 df-2nd 6047 df-1o 6321 df-dju 6931 df-inl 6940 df-inr 6941 df-case 6977 |
This theorem is referenced by: djudom 6986 exmidsbthrlem 13392 |
Copyright terms: Public domain | W3C validator |