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

Theorem updjudhf 7234
Description: The mapping of an element of the disjoint union to the value of the corresponding function is a function. (Contributed by AV, 26-Jun-2022.)
Hypotheses
Ref Expression
updjud.f (𝜑𝐹:𝐴𝐶)
updjud.g (𝜑𝐺:𝐵𝐶)
updjudhf.h 𝐻 = (𝑥 ∈ (𝐴𝐵) ↦ if((1st𝑥) = ∅, (𝐹‘(2nd𝑥)), (𝐺‘(2nd𝑥))))
Assertion
Ref Expression
updjudhf (𝜑𝐻:(𝐴𝐵)⟶𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜑,𝑥
Allowed substitution hints:   𝐹(𝑥)   𝐺(𝑥)   𝐻(𝑥)

Proof of Theorem updjudhf
StepHypRef Expression
1 eldju2ndl 7227 . . . . . 6 ((𝑥 ∈ (𝐴𝐵) ∧ (1st𝑥) = ∅) → (2nd𝑥) ∈ 𝐴)
21ex 115 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ → (2nd𝑥) ∈ 𝐴))
3 updjud.f . . . . . 6 (𝜑𝐹:𝐴𝐶)
4 ffvelcdm 5761 . . . . . . 7 ((𝐹:𝐴𝐶 ∧ (2nd𝑥) ∈ 𝐴) → (𝐹‘(2nd𝑥)) ∈ 𝐶)
54ex 115 . . . . . 6 (𝐹:𝐴𝐶 → ((2nd𝑥) ∈ 𝐴 → (𝐹‘(2nd𝑥)) ∈ 𝐶))
63, 5syl 14 . . . . 5 (𝜑 → ((2nd𝑥) ∈ 𝐴 → (𝐹‘(2nd𝑥)) ∈ 𝐶))
72, 6sylan9r 410 . . . 4 ((𝜑𝑥 ∈ (𝐴𝐵)) → ((1st𝑥) = ∅ → (𝐹‘(2nd𝑥)) ∈ 𝐶))
87imp 124 . . 3 (((𝜑𝑥 ∈ (𝐴𝐵)) ∧ (1st𝑥) = ∅) → (𝐹‘(2nd𝑥)) ∈ 𝐶)
9 df-ne 2401 . . . . 5 ((1st𝑥) ≠ ∅ ↔ ¬ (1st𝑥) = ∅)
10 eldju2ndr 7228 . . . . . . 7 ((𝑥 ∈ (𝐴𝐵) ∧ (1st𝑥) ≠ ∅) → (2nd𝑥) ∈ 𝐵)
1110ex 115 . . . . . 6 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) ≠ ∅ → (2nd𝑥) ∈ 𝐵))
12 updjud.g . . . . . . 7 (𝜑𝐺:𝐵𝐶)
13 ffvelcdm 5761 . . . . . . . 8 ((𝐺:𝐵𝐶 ∧ (2nd𝑥) ∈ 𝐵) → (𝐺‘(2nd𝑥)) ∈ 𝐶)
1413ex 115 . . . . . . 7 (𝐺:𝐵𝐶 → ((2nd𝑥) ∈ 𝐵 → (𝐺‘(2nd𝑥)) ∈ 𝐶))
1512, 14syl 14 . . . . . 6 (𝜑 → ((2nd𝑥) ∈ 𝐵 → (𝐺‘(2nd𝑥)) ∈ 𝐶))
1611, 15sylan9r 410 . . . . 5 ((𝜑𝑥 ∈ (𝐴𝐵)) → ((1st𝑥) ≠ ∅ → (𝐺‘(2nd𝑥)) ∈ 𝐶))
179, 16biimtrrid 153 . . . 4 ((𝜑𝑥 ∈ (𝐴𝐵)) → (¬ (1st𝑥) = ∅ → (𝐺‘(2nd𝑥)) ∈ 𝐶))
1817imp 124 . . 3 (((𝜑𝑥 ∈ (𝐴𝐵)) ∧ ¬ (1st𝑥) = ∅) → (𝐺‘(2nd𝑥)) ∈ 𝐶)
19 eldju1st 7226 . . . . . 6 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ ∨ (1st𝑥) = 1o))
20 1n0 6568 . . . . . . . 8 1o ≠ ∅
21 neeq1 2413 . . . . . . . 8 ((1st𝑥) = 1o → ((1st𝑥) ≠ ∅ ↔ 1o ≠ ∅))
2220, 21mpbiri 168 . . . . . . 7 ((1st𝑥) = 1o → (1st𝑥) ≠ ∅)
2322orim2i 766 . . . . . 6 (((1st𝑥) = ∅ ∨ (1st𝑥) = 1o) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2419, 23syl 14 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2524adantl 277 . . . 4 ((𝜑𝑥 ∈ (𝐴𝐵)) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
26 dcne 2411 . . . 4 (DECID (1st𝑥) = ∅ ↔ ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2725, 26sylibr 134 . . 3 ((𝜑𝑥 ∈ (𝐴𝐵)) → DECID (1st𝑥) = ∅)
288, 18, 27ifcldadc 3632 . 2 ((𝜑𝑥 ∈ (𝐴𝐵)) → if((1st𝑥) = ∅, (𝐹‘(2nd𝑥)), (𝐺‘(2nd𝑥))) ∈ 𝐶)
29 updjudhf.h . 2 𝐻 = (𝑥 ∈ (𝐴𝐵) ↦ if((1st𝑥) = ∅, (𝐹‘(2nd𝑥)), (𝐺‘(2nd𝑥))))
3028, 29fmptd 5782 1 (𝜑𝐻:(𝐴𝐵)⟶𝐶)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 713  DECID wdc 839   = wceq 1395  wcel 2200  wne 2400  c0 3491  ifcif 3602  cmpt 4144  wf 5310  cfv 5314  1st c1st 6274  2nd c2nd 6275  1oc1o 6545  cdju 7192
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4521
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4381  df-iord 4454  df-on 4456  df-suc 4459  df-xp 4722  df-rel 4723  df-cnv 4724  df-co 4725  df-dm 4726  df-rn 4727  df-res 4728  df-ima 4729  df-iota 5274  df-fun 5316  df-fn 5317  df-f 5318  df-f1 5319  df-fo 5320  df-f1o 5321  df-fv 5322  df-1st 6276  df-2nd 6277  df-1o 6552  df-dju 7193  df-inl 7202  df-inr 7203
This theorem is referenced by:  updjudhcoinlf  7235  updjudhcoinrg  7236  updjud  7237
  Copyright terms: Public domain W3C validator