| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssint | Structured version Visualization version GIF version | ||
| Description: Subclass of a class intersection. Theorem 5.11(viii) of [Monk1] p. 52 and its converse. (Contributed by NM, 14-Oct-1999.) |
| Ref | Expression |
|---|---|
| ssint | ⊢ (𝐴 ⊆ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐴 ⊆ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfss3 3920 | . 2 ⊢ (𝐴 ⊆ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵) | |
| 2 | vex 3455 | . . . 4 ⊢ 𝑦 ∈ V | |
| 3 | 2 | elint2 4914 | . . 3 ⊢ (𝑦 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 4 | 3 | ralbii 3109 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 5 | ralcom 3291 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 6 | dfss3 3920 | . . . 4 ⊢ (𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 7 | 6 | ralbii 3109 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 𝐴 ⊆ 𝑥 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) |
| 8 | 5, 7 | bitr4i 281 | . 2 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐵 𝐴 ⊆ 𝑥) |
| 9 | 1, 4, 8 | 3bitri 300 | 1 ⊢ (𝐴 ⊆ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐴 ⊆ 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 ∀wral 3077 ⊆ wss 3899 ∩ cint 4907 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-11 2194 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-v 3453 df-ss 3916 df-int 4908 |
| This theorem is used by: ssintab 4925 ssintub 4926 iinpw 5066 oneqmini 6409 fint 6753 fnssintima 7364 sorpssint 7738 iscard2 10038 coftr 10332 isf32lem2 10413 inttsk 10840 dfrtrcl2 15195 isacs1i 17811 mrelatglb 18714 rspprop 21504 ssdifidllem 21620 fbfinnfr 24140 fclscmp 24329 noextenddif 28007 eqcuts2 28154 cutsun12 28158 oniso 28639 bdayn0p1 28737 ssmxidllem 33980 fneint 37106 topmeet 37122 igenval2 38968 ismrcd1 43662 onintunirab 44187 dftrcl3 44679 dfrtrcl3 44692 sssalgen 47289 issalgend 47292 intubeu 50036 ipoglblem 50041 |
| Copyright terms: Public domain | W3C validator |