![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elno2 | Structured version Visualization version GIF version |
Description: An alternative condition for membership in No . (Contributed by Scott Fenton, 21-Mar-2012.) |
Ref | Expression |
---|---|
elno2 | ⊢ (𝐴 ∈ No ↔ (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nofun 27141 | . . 3 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
2 | nodmon 27142 | . . 3 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On) | |
3 | norn 27143 | . . 3 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
4 | 1, 2, 3 | 3jca 1128 | . 2 ⊢ (𝐴 ∈ No → (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o})) |
5 | simp2 1137 | . . . 4 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → dom 𝐴 ∈ On) | |
6 | simpl 483 | . . . . . . . 8 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On) → Fun 𝐴) | |
7 | 6 | funfnd 6576 | . . . . . . 7 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On) → 𝐴 Fn dom 𝐴) |
8 | 7 | anim1i 615 | . . . . . 6 ⊢ (((Fun 𝐴 ∧ dom 𝐴 ∈ On) ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o})) |
9 | 8 | 3impa 1110 | . . . . 5 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o})) |
10 | df-f 6544 | . . . . 5 ⊢ (𝐴:dom 𝐴⟶{1o, 2o} ↔ (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o})) | |
11 | 9, 10 | sylibr 233 | . . . 4 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → 𝐴:dom 𝐴⟶{1o, 2o}) |
12 | feq2 6696 | . . . . 5 ⊢ (𝑥 = dom 𝐴 → (𝐴:𝑥⟶{1o, 2o} ↔ 𝐴:dom 𝐴⟶{1o, 2o})) | |
13 | 12 | rspcev 3612 | . . . 4 ⊢ ((dom 𝐴 ∈ On ∧ 𝐴:dom 𝐴⟶{1o, 2o}) → ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o}) |
14 | 5, 11, 13 | syl2anc 584 | . . 3 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o}) |
15 | elno 27138 | . . 3 ⊢ (𝐴 ∈ No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o}) | |
16 | 14, 15 | sylibr 233 | . 2 ⊢ ((Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o}) → 𝐴 ∈ No ) |
17 | 4, 16 | impbii 208 | 1 ⊢ (𝐴 ∈ No ↔ (Fun 𝐴 ∧ dom 𝐴 ∈ On ∧ ran 𝐴 ⊆ {1o, 2o})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∈ wcel 2106 ∃wrex 3070 ⊆ wss 3947 {cpr 4629 dom cdm 5675 ran crn 5676 Oncon0 6361 Fun wfun 6534 Fn wfn 6535 ⟶wf 6536 1oc1o 8455 2oc2o 8456 No csur 27132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-no 27135 |
This theorem is referenced by: elno3 27147 noextend 27158 noextendseq 27159 nosupno 27195 noinfno 27210 onnog 42165 |
Copyright terms: Public domain | W3C validator |