| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sess2 | GIF version | ||
| Description: Subset theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.) |
| Ref | Expression |
|---|---|
| sess2 | ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Se 𝐵 → 𝑅 Se 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssralv 3288 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V → ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V)) | |
| 2 | rabss2 3307 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥}) | |
| 3 | ssexg 4222 | . . . . . 6 ⊢ (({𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∧ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V) → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V) | |
| 4 | 3 | ex 115 | . . . . 5 ⊢ ({𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} → ({𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V)) |
| 5 | 2, 4 | syl 14 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → ({𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V)) |
| 6 | 5 | ralimdv 2598 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V → ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V)) |
| 7 | 1, 6 | syld 45 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V → ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V)) |
| 8 | df-se 4423 | . 2 ⊢ (𝑅 Se 𝐵 ↔ ∀𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} ∈ V) | |
| 9 | df-se 4423 | . 2 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V) | |
| 10 | 7, 8, 9 | 3imtr4g 205 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Se 𝐵 → 𝑅 Se 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2200 ∀wral 2508 {crab 2512 Vcvv 2799 ⊆ wss 3197 class class class wbr 4082 Se wse 4419 |
| 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 ax-sep 4201 |
| This theorem depends on definitions: df-bi 117 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-rab 2517 df-v 2801 df-in 3203 df-ss 3210 df-se 4423 |
| This theorem is referenced by: seeq2 4430 |
| Copyright terms: Public domain | W3C validator |