| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > speano5 | GIF version | ||
| Description: Version of peano5 4720 when 𝐴 is assumed to be a set, allowing a proof from the core axioms of CZF. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| speano5 | ⊢ ((𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-omex 16712 | . . . 4 ⊢ ω ∈ V | |
| 2 | bj-inex 16677 | . . . 4 ⊢ ((ω ∈ V ∧ 𝐴 ∈ 𝑉) → (ω ∩ 𝐴) ∈ V) | |
| 3 | 1, 2 | mpan 424 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (ω ∩ 𝐴) ∈ V) |
| 4 | peano5set 16710 | . . 3 ⊢ ((ω ∩ 𝐴) ∈ V → ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)) | |
| 5 | 3, 4 | syl 14 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)) |
| 6 | 5 | 3impib 1228 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 ∈ wcel 2203 ∀wral 2520 Vcvv 2813 ∩ cin 3210 ⊆ wss 3211 ∅c0 3508 suc csuc 4486 ωcom 4712 |
| 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-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-nul 4236 ax-pr 4322 ax-un 4554 ax-bd0 16583 ax-bdan 16585 ax-bdor 16586 ax-bdex 16589 ax-bdeq 16590 ax-bdel 16591 ax-bdsb 16592 ax-bdsep 16654 ax-infvn 16711 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-sn 3695 df-pr 3696 df-uni 3915 df-int 3950 df-suc 4492 df-iom 4713 df-bdc 16611 df-bj-ind 16697 |
| This theorem is referenced by: findset 16715 |
| Copyright terms: Public domain | W3C validator |