| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > smoel2 | GIF version | ||
| Description: A strictly monotone ordinal function preserves the epsilon relation. (Contributed by Mario Carneiro, 12-Mar-2013.) |
| Ref | Expression |
|---|---|
| smoel2 | ⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fndm 5426 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | 1 | eleq2d 2299 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴)) |
| 3 | 2 | anbi1d 465 | . . . 4 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵))) |
| 4 | 3 | biimprd 158 | . . 3 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵))) |
| 5 | smoel 6461 | . . . 4 ⊢ ((Smo 𝐹 ∧ 𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) | |
| 6 | 5 | 3expib 1230 | . . 3 ⊢ (Smo 𝐹 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))) |
| 7 | 4, 6 | sylan9 409 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ Smo 𝐹) → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))) |
| 8 | 7 | imp 124 | 1 ⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2200 dom cdm 4723 Fn wfn 5319 ‘cfv 5324 Smo wsmo 6446 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2802 df-un 3202 df-in 3204 df-ss 3211 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-br 4087 df-tr 4186 df-iord 4461 df-iota 5284 df-fn 5327 df-fv 5332 df-smo 6447 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |