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

Theorem elno2 28011
Description: An alternative condition for membership in No. (Contributed by Scott Fenton, 21-Mar-2012.)
Assertion
Ref Expression
elno2 (𝐴 ∈ No ↔ (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}))

Proof of Theorem elno2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 nofun 28006 . . 3 (𝐴 ∈ No → Fun 𝐴)
2 nodmon 28007 . . 3 (𝐴 ∈ No → dom 𝐴 ∈ On)
3 norn 28008 . . 3 (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o})
41, 2, 33jca 1146 . 2 (𝐴 ∈ No → (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}))
5 simp2 1155 . . . 4 ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → dom 𝐴 ∈ On)
6 simpl 488 . . . . . . . 8 ((Fun 𝐴 ∧ dom 𝐴 ∈ On) → Fun 𝐴)
76funfnd 6571 . . . . . . 7 ((Fun 𝐴 ∧ dom 𝐴 ∈ On) → 𝐴 Fn dom 𝐴)
87anim1i 627 . . . . . 6 (((Fun 𝐴 ∧ dom 𝐴 ∈ On) ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}))
983impa 1127 . . . . 5 ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}))
10 df-f 6542 . . . . 5 (𝐴:dom 𝐴⟶{1o, 2o} ↔ (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}))
119, 10sylibr 237 . . . 4 ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → 𝐴:dom 𝐴⟶{1o, 2o})
12 feq2 6688 . . . . 5 (𝑥 = dom 𝐴 → (𝐴:𝑥⟶{1o, 2o} ↔ 𝐴:dom 𝐴⟶{1o, 2o}))
1312rspcev 3577 . . . 4 ((dom 𝐴 ∈ On ∧ 𝐴:dom 𝐴⟶{1o, 2o}) → ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
145, 11, 13syl2anc 596 . . 3 ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
15 elno 28003 . . 3 (𝐴 ∈ No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
1614, 15sylibr 237 . 2 ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → 𝐴 ∈ No)
174, 16impbii 212 1 (𝐴 ∈ No ↔ (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∃wrex 3087   ⊆ wss 3899  {cpr 4586  dom cdm 5651  ran crn 5652  Oncon0 6362  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  1oc1o 8469  2oc2o 8470  Nocsur 27997
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-fun 6540  df-fn 6541  df-f 6542  df-no 28000
This theorem is used by:  elno3  28012  noextend  28023  noextendseq  28024  nosupno  28060  noinfno  28075  onnoxpg  44429
  Copyright terms: Public domain W3C validator