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

Theorem updjudhf 7278
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 7271 . . . . . 6 ((𝑥 ∈ (𝐴𝐵) ∧ (1st𝑥) = ∅) → (2nd𝑥) ∈ 𝐴)
21ex 115 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ → (2nd𝑥) ∈ 𝐴))
3 updjud.f . . . . . 6 (𝜑𝐹:𝐴𝐶)
4 ffvelcdm 5780 . . . . . . 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 2403 . . . . 5 ((1st𝑥) ≠ ∅ ↔ ¬ (1st𝑥) = ∅)
10 eldju2ndr 7272 . . . . . . 7 ((𝑥 ∈ (𝐴𝐵) ∧ (1st𝑥) ≠ ∅) → (2nd𝑥) ∈ 𝐵)
1110ex 115 . . . . . 6 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) ≠ ∅ → (2nd𝑥) ∈ 𝐵))
12 updjud.g . . . . . . 7 (𝜑𝐺:𝐵𝐶)
13 ffvelcdm 5780 . . . . . . . 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 7270 . . . . . 6 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ ∨ (1st𝑥) = 1o))
20 1n0 6600 . . . . . . . 8 1o ≠ ∅
21 neeq1 2415 . . . . . . . 8 ((1st𝑥) = 1o → ((1st𝑥) ≠ ∅ ↔ 1o ≠ ∅))
2220, 21mpbiri 168 . . . . . . 7 ((1st𝑥) = 1o → (1st𝑥) ≠ ∅)
2322orim2i 768 . . . . . 6 (((1st𝑥) = ∅ ∨ (1st𝑥) = 1o) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2419, 23syl 14 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2524adantl 277 . . . 4 ((𝜑𝑥 ∈ (𝐴𝐵)) → ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
26 dcne 2413 . . . 4 (DECID (1st𝑥) = ∅ ↔ ((1st𝑥) = ∅ ∨ (1st𝑥) ≠ ∅))
2725, 26sylibr 134 . . 3 ((𝜑𝑥 ∈ (𝐴𝐵)) → DECID (1st𝑥) = ∅)
288, 18, 27ifcldadc 3635 . 2 ((𝜑𝑥 ∈ (𝐴𝐵)) → if((1st𝑥) = ∅, (𝐹‘(2nd𝑥)), (𝐺‘(2nd𝑥))) ∈ 𝐶)
29 updjudhf.h . 2 𝐻 = (𝑥 ∈ (𝐴𝐵) ↦ if((1st𝑥) = ∅, (𝐹‘(2nd𝑥)), (𝐺‘(2nd𝑥))))
3028, 29fmptd 5801 1 (𝜑𝐻:(𝐴𝐵)⟶𝐶)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 715  DECID wdc 841   = wceq 1397  wcel 2202  wne 2402  c0 3494  ifcif 3605  cmpt 4150  wf 5322  cfv 5326  1st c1st 6301  2nd c2nd 6302  1oc1o 6575  cdju 7236
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-dc 842  df-3an 1006  df-tru 1400  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-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  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-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  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-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1st 6303  df-2nd 6304  df-1o 6582  df-dju 7237  df-inl 7246  df-inr 7247
This theorem is referenced by:  updjudhcoinlf  7279  updjudhcoinrg  7280  updjud  7281
  Copyright terms: Public domain W3C validator