| 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 3902 | . 2 ⊢ (𝐴 ⊆ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵) | |
| 2 | vex 3458 | . . . 4 ⊢ 𝑦 ∈ V | |
| 3 | 2 | elint2 4917 | . . 3 ⊢ (𝑦 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 4 | 3 | ralbii 3112 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥) |
| 5 | ralcom 3294 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 6 | dfss3 3902 | . . . 4 ⊢ (𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 7 | 6 | ralbii 3112 | . . 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 2147 ∀wral 3080 ⊆ wss 3900 ∩ cint 4910 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-11 2197 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-v 3456 df-ss 3901 df-int 4911 |
| This theorem is used by: ssintab 4928 ssintub 4929 iinpw 5069 oneqmini 6437 fint 6786 fnssintima 7398 sorpssint 7776 iscard2 10087 coftr 10381 isf32lem2 10462 inttsk 10889 dfrtrcl2 15247 isacs1i 17863 mrelatglb 18766 rspprop 21557 ssdifidllem 21673 fbfinnfr 24193 fclscmp 24382 noextenddif 28058 eqcuts2 28205 cutsun12 28209 oniso 28690 bdayn0p1 28788 ssmxidllem 34082 fneint 37327 topmeet 37343 igenval2 39203 ismrcd1 43913 onintunirab 44432 dftrcl3 44923 dfrtrcl3 44936 sssalgen 47560 issalgend 47563 intubeu 50313 ipoglblem 50318 |
| Copyright terms: Public domain | W3C validator |