| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nolt02olem | Structured version Visualization version GIF version | ||
| Description: Lemma for nolt02o 28079. 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 28042 | . . . 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 28035 | . . . . . 6 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ran 𝐴 ⊆ {1o, 2o}) |
| 7 | nofun 28033 | . . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 8 | 7 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → Fun 𝐴) |
| 9 | fvelrn 7097 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 10 | 8, 9 | sylan 592 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) |
| 11 | 6, 10 | sseldd 3914 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ {1o, 2o}) |
| 12 | 3, 11 | eqeltrrd 2865 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ∅ ∈ {1o, 2o}) |
| 13 | 2, 12 | mtand 828 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ 𝑋 ∈ dom 𝐴) |
| 14 | nodmon 28034 | . . . 4 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On) | |
| 15 | 14 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ∈ On) |
| 16 | simp2 1155 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → 𝑋 ∈ On) | |
| 17 | ontri1 6412 | . . 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 1570 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 {cpr 4590 dom cdm 5655 ran crn 5656 Oncon0 6377 Fun wfun 6549 ‘cfv 6555 1oc1o 8494 2oc2o 8495 Nocsur 28024 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-ord 6380 df-on 6381 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-fv 6563 df-1o 8501 df-2o 8502 df-no 28027 |
| This theorem is used by: nolt02o 28079 nogt01o 28080 |
| Copyright terms: Public domain | W3C validator |