HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem alephnbtwn2 4934
Description: No set has equinumerosity between an aleph and its successor aleph.
Assertion
Ref Expression
alephnbtwn2 |- -. ((aleph` A) ~< B /\ B ~< (aleph` suc A))

Proof of Theorem alephnbtwn2
StepHypRef Expression
1 cardidm 4914 . . . 4 |- (card` (card` B)) = (card` B)
2 alephnbtwn 4933 . . . 4 |- ((card` (card` B)) = (card` B) -> -. ((aleph` A) e. (card` B) /\ (card` B) e. (aleph` suc A)))
31, 2ax-mp 7 . . 3 |- -. ((aleph` A) e. (card` B) /\ (card` B) e. (aleph` suc A))
4 alephon 4930 . . . . . 6 |- (aleph` A) e. On
5 cardsdomel 4917 . . . . . 6 |- ((aleph` A) e. On -> ((aleph` A) ~< B <-> (aleph` A) e. (card` B)))
64, 5ax-mp 7 . . . . 5 |- ((aleph` A) ~< B <-> (aleph` A) e. (card` B))
76a1i 8 . . . 4 |- (B e. V -> ((aleph` A) ~< B <-> (aleph` A) e. (card` B)))
8 alephon 4930 . . . . . 6 |- (aleph` suc A) e. On
9 cardsdom 4901 . . . . . 6 |- ((B e. V /\ (aleph` suc A) e. On) -> ((card` B) e. (card` (aleph` suc A)) <-> B ~< (aleph` suc A)))
108, 9mpan2 708 . . . . 5 |- (B e. V -> ((card` B) e. (card` (aleph` suc A)) <-> B ~< (aleph` suc A)))
11 alephcard 4932 . . . . . 6 |- (card` (aleph` suc A)) = (aleph` suc A)
1211eleq2i 1585 . . . . 5 |- ((card` B) e. (card` (aleph` suc A)) <-> (card` B) e. (aleph` suc A))
1310, 12syl5rbbr 546 . . . 4 |- (B e. V -> (B ~< (aleph` suc A) <-> (card` B) e. (aleph` suc A)))
147, 13anbi12d 639 . . 3 |- (B e. V -> (((aleph` A) ~< B /\ B ~< (aleph` suc A)) <-> ((aleph` A) e. (card` B) /\ (card` B) e. (aleph` suc A))))
153, 14mtbiri 729 . 2 |- (B e. V -> -. ((aleph` A) ~< B /\ B ~< (aleph` suc A)))
16 relsdom 4435 . . . . 5 |- Rel ~<
1716brrelexi 3265 . . . 4 |- (B ~< (aleph` suc A) -> B e. V)
1817adantl 397 . . 3 |- (((aleph` A) ~< B /\ B ~< (aleph` suc A)) -> B e. V)
1918con3i 104 . 2 |- (-. B e. V -> -. ((aleph` A) ~< B /\ B ~< (aleph` suc A)))
2015, 19pm2.61i 132 1 |- -. ((aleph` A) ~< B /\ B ~< (aleph` suc A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 153   /\ wa 230   = wceq 997   e. wcel 999  Vcvv 1858   class class class wbr 2674  Oncon0 3005  suc csuc 3007  ` cfv 3239   ~< csdm 4427  cardccrd 4875  alephcale 4876
This theorem is referenced by:  alephsucpw 4935  alephsucdom 4945  aleph1re 7643
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-9 1006  ax-10 1007  ax-11 1008  ax-12 1009  ax-13 1010  ax-14 1011  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-10o 1182  ax-16 1252  ax-11o 1260  ax-ext 1504  ax-rep 2748  ax-sep 2758  ax-nul 2765  ax-pow 2798  ax-pr 2835  ax-un 2922  ax-reg 4653  ax-inf2 4687  ax-ac 4806
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-3or 788  df-3an 789  df-ex 1022  df-sb 1214  df-eu 1424  df-mo 1425  df-clab 1510  df-cleq 1515  df-clel 1518  df-ne 1634  df-ral 1696  df-rex 1697  df-reu 1698  df-rab 1699  df-v 1859  df-sbc 1989  df-dif 2100  df-un 2101  df-in 2102  df-ss 2104  df-pss 2106  df-nul 2332  df-if 2414  df-pw 2454  df-sn 2464  df-pr 2465  df-tp 2467  df-op 2468  df-uni 2558  df-int 2588  df-iun 2622  df-br 2675  df-opab 2722  df-tr 2736  df-eprel 2888  df-id 2891  df-po 2896  df-so 2906  df-fr 2974  df-we 2991  df-ord 3008  df-on 3009  df-lim 3010  df-suc 3011  df-om 3189  df-xp 3241  df-rel 3242  df-cnv 3243  df-co 3244  df-dm 3245  df-rn 3246  df-res 3247  df-ima 3248  df-fun 3249  df-fn 3250  df-f 3251  df-f1 3252  df-fo 3253  df-f1o 3254  df-fv 3255  df-rdg 3990  df-er 4319  df-en 4429  df-dom 4430  df-sdom 4431  df-fin 4432  df-card 4878  df-aleph 4879
Copyright terms: Public domain