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 49671
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 49670 assuming ax-un 7732 (see f1omoALT 49673). (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 8459 . . . 4 1o ∈ V
2 eqid 2763 . . . 4 ((𝐴 × {1o})‘𝑋) = ((𝐴 × {1o})‘𝑋)
31, 2fvconst0ci 49669 . . 3 (((𝐴 × {1o})‘𝑋) = ∅ ∨ ((𝐴 × {1o})‘𝑋) = 1o)
4 mo0 49592 . . . 4 (((𝐴 × {1o})‘𝑋) = ∅ → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
5 df1o2 8456 . . . . . 6 1o = {∅}
65eqeq2i 2776 . . . . 5 (((𝐴 × {1o})‘𝑋) = 1o ↔ ((𝐴 × {1o})‘𝑋) = {∅})
7 mosn 49591 . . . . 5 (((𝐴 × {1o})‘𝑋) = {∅} → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
86, 7sylbi 220 . . . 4 (((𝐴 × {1o})‘𝑋) = 1o → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
94, 8jaoi 870 . . 3 ((((𝐴 × {1o})‘𝑋) = ∅ ∨ ((𝐴 × {1o})‘𝑋) = 1o) → ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋))
103, 9ax-mp 5 . 2 ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋)
11 f1omo.1 . . . . 5 (𝜑𝐹 = (𝐴 × {1o}))
1211fveq1d 6883 . . . 4 (𝜑 → (𝐹𝑋) = ((𝐴 × {1o})‘𝑋))
1312eleq2d 2849 . . 3 (𝜑 → (𝑦 ∈ (𝐹𝑋) ↔ 𝑦 ∈ ((𝐴 × {1o})‘𝑋)))
1413mobidv 2577 . 2 (𝜑 → (∃*𝑦 𝑦 ∈ (𝐹𝑋) ↔ ∃*𝑦 𝑦 ∈ ((𝐴 × {1o})‘𝑋)))
1510, 14mpbiri 261 1 (𝜑 → ∃*𝑦 𝑦 ∈ (𝐹𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 860   = wceq 1570  wcel 2143  ∃*wmo 2565  c0 4286  {csn 4589   × cxp 5659  cfv 6536  1oc1o 8442
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-1o 8449
This theorem is referenced by:  indthinc  50240  prsthinc  50242
  Copyright terms: Public domain W3C validator