| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nolt02olem | Structured version Visualization version GIF version | ||
| Description: Lemma for nolt02o 28052. If 𝐴(𝑋) is undefined with 𝐴 surreal and 𝑋 ordinal, then dom 𝐴 ⊆ 𝑋. (Contributed by Scott Fenton, 6-Dec-2021.) |
| Ref | Expression |
|---|---|
| nolt02olem | ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ⊆ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nosgnn0 28015 | . . . 4 ⊢ ¬ ∅ ∈ {1o, 2o} | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ ∅ ∈ {1o, 2o}) |
| 3 | simpl3 1212 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) = ∅) | |
| 4 | simpl1 1210 | . . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → 𝐴 ∈ No) | |
| 5 | norn 28008 | . . . . . 6 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ran 𝐴 ⊆ {1o, 2o}) |
| 7 | nofun 28006 | . . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 8 | 7 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → Fun 𝐴) |
| 9 | fvelrn 7076 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 10 | 8, 9 | sylan 592 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) |
| 11 | 6, 10 | sseldd 3909 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ {1o, 2o}) |
| 12 | 3, 11 | eqeltrrd 2861 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ∅ ∈ {1o, 2o}) |
| 13 | 2, 12 | mtand 828 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ 𝑋 ∈ dom 𝐴) |
| 14 | nodmon 28007 | . . . 4 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On) | |
| 15 | 14 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ∈ On) |
| 16 | simp2 1155 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → 𝑋 ∈ On) | |
| 17 | ontri1 6397 | . . 3 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ On) → (dom 𝐴 ⊆ 𝑋 ↔ ¬ 𝑋 ∈ dom 𝐴)) | |
| 18 | 15, 16, 17 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → (dom 𝐴 ⊆ 𝑋 ↔ ¬ 𝑋 ∈ dom 𝐴)) |
| 19 | 13, 18 | mpbird 260 | 1 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∅c0 4278 {cpr 4585 dom cdm 5650 ran crn 5651 Oncon0 6362 Fun wfun 6532 ‘cfv 6538 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 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-1o 8476 df-2o 8477 df-no 28000 |
| This theorem is used by: nolt02o 28052 nogt01o 28053 |
| Copyright terms: Public domain | W3C validator |