Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  f1omo Structured version   Visualization version   GIF version

Theorem f1omo 49511
Description: There is at most one element in the function value of a constant function whose output is 1o. (An artifact of our function value definition.) Proof could be significantly shortened by fvconstdomi 49510 assuming ax-un 7718 (see f1omoALT 49513). (Contributed by Zhi Wang, 19-Sep-2024.) (Proof shortened by SN, 24-Nov-2025.)
Hypothesis
Ref Expression
f1omo.1 (𝜑𝐹 = (𝐴 × {1o}))
Assertion
Ref Expression
f1omo (𝜑 → ∃*𝑦 𝑦 ∈ (𝐹𝑋))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐹   𝑦,𝑋   𝜑,𝑦

Proof of Theorem f1omo
StepHypRef Expression
1 1oex 8447 . . . 4 1o ∈ V
2 eqid 2762 . . . 4 ((𝐴 × {1o})‘𝑋) = ((𝐴 × {1o})‘𝑋)
31, 2fvconst0ci 49509 . . 3 (((𝐴 × {1o})‘𝑋) = ∅ ∨ ((𝐴 × {1o})‘𝑋) = 1o)
4 mo0 49432 . . . 4 (((𝐴 × {1o})‘𝑋) = ∅ → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
5 df1o2 8444 . . . . . 6 1o = {∅}
65eqeq2i 2775 . . . . 5 (((𝐴 × {1o})‘𝑋) = 1o ↔ ((𝐴 × {1o})‘𝑋) = {∅})
7 mosn 49431 . . . . 5 (((𝐴 × {1o})‘𝑋) = {∅} → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
86, 7sylbi 219 . . . 4 (((𝐴 × {1o})‘𝑋) = 1o → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
94, 8jaoi 868 . . 3 ((((𝐴 × {1o})‘𝑋) = ∅ ∨ ((𝐴 × {1o})‘𝑋) = 1o) → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
103, 9ax-mp 5 . 2 ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋)
11 f1omo.1 . . . . 5 (𝜑𝐹 = (𝐴 × {1o}))
1211fveq1d 6869 . . . 4 (𝜑 → (𝐹𝑋) = ((𝐴 × {1o})‘𝑋))
1312eleq2d 2848 . . 3 (𝜑 → (𝑦 ∈ (𝐹𝑋) ↔ 𝑦 ∈ ((𝐴 × {1o})‘𝑋)))
1413mobidv 2576 . 2 (𝜑 → (∃*𝑦 𝑦 ∈ (𝐹𝑋) ↔ ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋)))
1510, 14mpbiri 260 1 (𝜑 → ∃*𝑦 𝑦 ∈ (𝐹𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 858   = wceq 1560  wcel 2142  ∃*wmo 2564  c0 4285  {csn 4582   × cxp 5645  cfv 6521  1oc1o 8430
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-fv 6529  df-1o 8437
This theorem is referenced by:  indthinc  50080  prsthinc  50082
  Copyright terms: Public domain W3C validator