MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2dom Structured version   Visualization version   GIF version

Theorem 2dom 8967
Description: A set that dominates ordinal 2 has at least 2 different members. (Contributed by NM, 25-Jul-2004.)
Assertion
Ref Expression
2dom (2o𝐴 → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 = 𝑦)
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem 2dom
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 df2o2 8404 . . . 4 2o = {∅, {∅}}
21breq1i 5079 . . 3 (2o𝐴 ↔ {∅, {∅}} ≼ 𝐴)
3 brdomi 8896 . . 3 ({∅, {∅}} ≼ 𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1𝐴)
42, 3sylbi 218 . 2 (2o𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1𝐴)
5 f1f 6723 . . . . 5 (𝑓:{∅, {∅}}–1-1𝐴𝑓:{∅, {∅}}⟶𝐴)
6 0ex 5229 . . . . . 6 ∅ ∈ V
76prid1 4694 . . . . 5 ∅ ∈ {∅, {∅}}
8 ffvelcdm 7022 . . . . 5 ((𝑓:{∅, {∅}}⟶𝐴 ∧ ∅ ∈ {∅, {∅}}) → (𝑓‘∅) ∈ 𝐴)
95, 7, 8sylancl 592 . . . 4 (𝑓:{∅, {∅}}–1-1𝐴 → (𝑓‘∅) ∈ 𝐴)
10 snex 5368 . . . . . 6 {∅} ∈ V
1110prid2 4695 . . . . 5 {∅} ∈ {∅, {∅}}
12 ffvelcdm 7022 . . . . 5 ((𝑓:{∅, {∅}}⟶𝐴 ∧ {∅} ∈ {∅, {∅}}) → (𝑓‘{∅}) ∈ 𝐴)
135, 11, 12sylancl 592 . . . 4 (𝑓:{∅, {∅}}–1-1𝐴 → (𝑓‘{∅}) ∈ 𝐴)
14 0nep0 5286 . . . . . 6 ∅ ≠ {∅}
1514neii 2936 . . . . 5 ¬ ∅ = {∅}
16 f1fveq 7206 . . . . . 6 ((𝑓:{∅, {∅}}–1-1𝐴 ∧ (∅ ∈ {∅, {∅}} ∧ {∅} ∈ {∅, {∅}})) → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅}))
177, 11, 16mpanr12 711 . . . . 5 (𝑓:{∅, {∅}}–1-1𝐴 → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅}))
1815, 17mtbiri 328 . . . 4 (𝑓:{∅, {∅}}–1-1𝐴 → ¬ (𝑓‘∅) = (𝑓‘{∅}))
19 eqeq1 2743 . . . . . 6 (𝑥 = (𝑓‘∅) → (𝑥 = 𝑦 ↔ (𝑓‘∅) = 𝑦))
2019notbid 319 . . . . 5 (𝑥 = (𝑓‘∅) → (¬ 𝑥 = 𝑦 ↔ ¬ (𝑓‘∅) = 𝑦))
21 eqeq2 2751 . . . . . 6 (𝑦 = (𝑓‘{∅}) → ((𝑓‘∅) = 𝑦 ↔ (𝑓‘∅) = (𝑓‘{∅})))
2221notbid 319 . . . . 5 (𝑦 = (𝑓‘{∅}) → (¬ (𝑓‘∅) = 𝑦 ↔ ¬ (𝑓‘∅) = (𝑓‘{∅})))
2320, 22rspc2ev 3573 . . . 4 (((𝑓‘∅) ∈ 𝐴 ∧ (𝑓‘{∅}) ∈ 𝐴 ∧ ¬ (𝑓‘∅) = (𝑓‘{∅})) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 = 𝑦)
249, 13, 18, 23syl3anc 1379 . . 3 (𝑓:{∅, {∅}}–1-1𝐴 → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 = 𝑦)
2524exlimiv 1937 . 2 (∃𝑓 𝑓:{∅, {∅}}–1-1𝐴 → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 = 𝑦)
264, 25syl 17 1 (2o𝐴 → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 = 𝑦)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207   = wceq 1547  wex 1786  wcel 2119  wrex 3063  c0 4261  {csn 4555  {cpr 4557   class class class wbr 5072  wf 6481  1-1wf1 6482  cfv 6485  2oc2o 8389  cdom 8881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fv 6493  df-1o 8395  df-2o 8396  df-dom 8885
This theorem is referenced by:  1sdom  9155
  Copyright terms: Public domain W3C validator