| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nolt02olem | Structured version Visualization version GIF version | ||
| Description: Lemma for nolt02o 27927. 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 27890 | . . . 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 27883 | . . . . . 6 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ran 𝐴 ⊆ {1o, 2o}) |
| 7 | nofun 27881 | . . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 8 | 7 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → Fun 𝐴) |
| 9 | fvelrn 7072 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 10 | 8, 9 | sylan 592 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) |
| 11 | 6, 10 | sseldd 3935 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ {1o, 2o}) |
| 12 | 3, 11 | eqeltrrd 2863 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ∅ ∈ {1o, 2o}) |
| 13 | 2, 12 | mtand 828 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ 𝑋 ∈ dom 𝐴) |
| 14 | nodmon 27882 | . . . 4 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On) | |
| 15 | 14 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ∈ On) |
| 16 | simp2 1155 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → 𝑋 ∈ On) | |
| 17 | ontri1 6396 | . . 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 2145 ⊆ wss 3902 ∅c0 4282 {cpr 4589 dom cdm 5659 ran crn 5660 Oncon0 6361 Fun wfun 6531 ‘cfv 6537 1oc1o 8451 2oc2o 8452 No csur 27872 |
| 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-10 2178 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-1o 8458 df-2o 8459 df-no 27875 |
| This theorem is used by: nolt02o 27927 nogt01o 27928 |
| Copyright terms: Public domain | W3C validator |