| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > smoel2 | Structured version Visualization version GIF version | ||
| Description: A strictly monotone ordinal function preserves the membership relation. (Contributed by Mario Carneiro, 12-Mar-2013.) |
| Ref | Expression |
|---|---|
| smoel2 | ⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fndm 6641 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | 1 | eleq2d 2820 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴)) |
| 3 | 2 | anbi1d 631 | . . . 4 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))) |
| 4 | 3 | biimprd 248 | . . 3 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵))) |
| 5 | smoel 8374 | . . . 4 ⊢ ((Smo 𝐹 ∧ 𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) | |
| 6 | 5 | 3expib 1122 | . . 3 ⊢ (Smo 𝐹 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))) |
| 7 | 4, 6 | sylan9 507 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ Smo 𝐹) → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))) |
| 8 | 7 | imp 406 | 1 ⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 dom cdm 5654 Fn wfn 6526 ‘cfv 6531 Smo wsmo 8359 |
| 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 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-tr 5230 df-ord 6355 df-iota 6484 df-fn 6534 df-fv 6539 df-smo 8360 |
| This theorem is referenced by: smo11 8378 smoord 8379 smogt 8381 cofsmo 10283 |
| Copyright terms: Public domain | W3C validator |