| 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 3897 | . 2 ⊢ (𝐴 ⊆ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵) | |
| 2 | vex 3454 | . . . 4 ⊢ 𝑦 ∈ V | |
| 3 | 2 | elint2 4913 | . . 3 ⊢ (𝑦 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 4 | 3 | ralbii 3108 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 5 | ralcom 3290 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 6 | dfss3 3897 | . . . 4 ⊢ (𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 7 | 6 | ralbii 3108 | . . 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 2144 ∀wral 3076 ⊆ wss 3895 ∩ cint 4906 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-11 2193 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-v 3452 df-ss 3896 df-int 4907 |
| This theorem is used by: ssintab 4924 ssintub 4925 iinpw 5065 oneqmini 6416 fint 6761 fnssintima 7372 sorpssint 7749 iscard2 10060 coftr 10354 isf32lem2 10435 inttsk 10862 dfrtrcl2 15220 isacs1i 17836 mrelatglb 18739 rspprop 21529 ssdifidllem 21645 fbfinnfr 24165 fclscmp 24354 noextenddif 28030 eqcuts2 28177 cutsun12 28181 oniso 28662 bdayn0p1 28760 ssmxidllem 34044 fneint 37228 topmeet 37244 igenval2 39093 ismrcd1 43802 onintunirab 44322 dftrcl3 44813 dfrtrcl3 44826 sssalgen 47438 issalgend 47441 intubeu 50191 ipoglblem 50196 |
| Copyright terms: Public domain | W3C validator |