ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  casef1 GIF version

Theorem casef1 7420
Description: The "case" construction of two injective functions with disjoint ranges is an injective function. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
casef1.f (𝜑𝐹:𝐴1-1𝑋)
casef1.g (𝜑𝐺:𝐵1-1𝑋)
casef1.disj (𝜑 → (ran 𝐹 ∩ ran 𝐺) = ∅)
Assertion
Ref Expression
casef1 (𝜑 → case(𝐹, 𝐺):(𝐴𝐵)–1-1𝑋)

Proof of Theorem casef1
StepHypRef Expression
1 casef1.f . . . 4 (𝜑𝐹:𝐴1-1𝑋)
2 f1f 5593 . . . 4 (𝐹:𝐴1-1𝑋𝐹:𝐴𝑋)
31, 2syl 14 . . 3 (𝜑𝐹:𝐴𝑋)
4 casef1.g . . . 4 (𝜑𝐺:𝐵1-1𝑋)
5 f1f 5593 . . . 4 (𝐺:𝐵1-1𝑋𝐺:𝐵𝑋)
64, 5syl 14 . . 3 (𝜑𝐺:𝐵𝑋)
73, 6casef 7418 . 2 (𝜑 → case(𝐹, 𝐺):(𝐴𝐵)⟶𝑋)
8 df-f1 5377 . . . . 5 (𝐹:𝐴1-1𝑋 ↔ (𝐹:𝐴𝑋 ∧ Fun 𝐹))
98simprbi 275 . . . 4 (𝐹:𝐴1-1𝑋 → Fun 𝐹)
101, 9syl 14 . . 3 (𝜑 → Fun 𝐹)
11 df-f1 5377 . . . . 5 (𝐺:𝐵1-1𝑋 ↔ (𝐺:𝐵𝑋 ∧ Fun 𝐺))
1211simprbi 275 . . . 4 (𝐺:𝐵1-1𝑋 → Fun 𝐺)
134, 12syl 14 . . 3 (𝜑 → Fun 𝐺)
14 casef1.disj . . 3 (𝜑 → (ran 𝐹 ∩ ran 𝐺) = ∅)
1510, 13, 14caseinj 7419 . 2 (𝜑 → Fun case(𝐹, 𝐺))
16 df-f1 5377 . 2 (case(𝐹, 𝐺):(𝐴𝐵)–1-1𝑋 ↔ (case(𝐹, 𝐺):(𝐴𝐵)⟶𝑋 ∧ Fun case(𝐹, 𝐺)))
177, 15, 16sylanbrc 421 1 (𝜑 → case(𝐹, 𝐺):(𝐴𝐵)–1-1𝑋)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  cin 3219  c0 3520  ccnv 4768  ran crn 4770  Fun wfun 5366  wf 5368  1-1wf1 5369  cdju 7367  casecdjucase 7413
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-2nd 6365  df-1o 6677  df-dju 7368  df-inl 7377  df-inr 7378  df-case 7414
This theorem is referenced by:  djudom  7423  exmidsbthrlem  16972
  Copyright terms: Public domain W3C validator