| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nolt02olem | Structured version Visualization version GIF version | ||
| Description: Lemma for nolt02o 27664. 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 27627 | . . . 4 ⊢ ¬ ∅ ∈ {1o, 2o} | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ ∅ ∈ {1o, 2o}) |
| 3 | simpl3 1194 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) = ∅) | |
| 4 | simpl1 1192 | . . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → 𝐴 ∈ No ) | |
| 5 | norn 27620 | . . . . . 6 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | 4, 5 | syl 17 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ran 𝐴 ⊆ {1o, 2o}) |
| 7 | nofun 27618 | . . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 8 | 7 | 3ad2ant1 1133 | . . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → Fun 𝐴) |
| 9 | fvelrn 7071 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 10 | 8, 9 | sylan 580 | . . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) |
| 11 | 6, 10 | sseldd 3964 | . . . 4 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ {1o, 2o}) |
| 12 | 3, 11 | eqeltrrd 2836 | . . 3 ⊢ (((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) ∧ 𝑋 ∈ dom 𝐴) → ∅ ∈ {1o, 2o}) |
| 13 | 2, 12 | mtand 815 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → ¬ 𝑋 ∈ dom 𝐴) |
| 14 | nodmon 27619 | . . . 4 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On) | |
| 15 | 14 | 3ad2ant1 1133 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ∈ On) |
| 16 | simp2 1137 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → 𝑋 ∈ On) | |
| 17 | ontri1 6391 | . . 3 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ On) → (dom 𝐴 ⊆ 𝑋 ↔ ¬ 𝑋 ∈ dom 𝐴)) | |
| 18 | 15, 16, 17 | syl2anc 584 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → (dom 𝐴 ⊆ 𝑋 ↔ ¬ 𝑋 ∈ dom 𝐴)) |
| 19 | 13, 18 | mpbird 257 | 1 ⊢ ((𝐴 ∈ No ∧ 𝑋 ∈ On ∧ (𝐴‘𝑋) = ∅) → dom 𝐴 ⊆ 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ⊆ wss 3931 ∅c0 4313 {cpr 4608 dom cdm 5659 ran crn 5660 Oncon0 6357 Fun wfun 6530 ‘cfv 6536 1oc1o 8478 2oc2o 8479 No csur 27608 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-ord 6360 df-on 6361 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-1o 8485 df-2o 8486 df-no 27611 |
| This theorem is referenced by: nolt02o 27664 nogt01o 27665 |
| Copyright terms: Public domain | W3C validator |