| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > ssoprab2b | GIF version | ||
| Description: Equivalence of ordered pair abstraction subclass and implication. Compare ssopab2b 4311. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) | 
| Ref | Expression | 
|---|---|
| ssoprab2b | ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | nfoprab1 5971 | . . . 4 ⊢ Ⅎ𝑥{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} | |
| 2 | nfoprab1 5971 | . . . 4 ⊢ Ⅎ𝑥{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | |
| 3 | 1, 2 | nfss 3176 | . . 3 ⊢ Ⅎ𝑥{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | 
| 4 | nfoprab2 5972 | . . . . 5 ⊢ Ⅎ𝑦{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} | |
| 5 | nfoprab2 5972 | . . . . 5 ⊢ Ⅎ𝑦{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | |
| 6 | 4, 5 | nfss 3176 | . . . 4 ⊢ Ⅎ𝑦{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | 
| 7 | nfoprab3 5973 | . . . . . 6 ⊢ Ⅎ𝑧{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} | |
| 8 | nfoprab3 5973 | . . . . . 6 ⊢ Ⅎ𝑧{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | |
| 9 | 7, 8 | nfss 3176 | . . . . 5 ⊢ Ⅎ𝑧{〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} | 
| 10 | ssel 3177 | . . . . . 6 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} → (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} → 〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓})) | |
| 11 | oprabid 5954 | . . . . . 6 ⊢ (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ↔ 𝜑) | |
| 12 | oprabid 5954 | . . . . . 6 ⊢ (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ 𝜓) | |
| 13 | 10, 11, 12 | 3imtr3g 204 | . . . . 5 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} → (𝜑 → 𝜓)) | 
| 14 | 9, 13 | alrimi 1536 | . . . 4 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} → ∀𝑧(𝜑 → 𝜓)) | 
| 15 | 6, 14 | alrimi 1536 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} → ∀𝑦∀𝑧(𝜑 → 𝜓)) | 
| 16 | 3, 15 | alrimi 1536 | . 2 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} → ∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓)) | 
| 17 | ssoprab2 5978 | . 2 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓}) | |
| 18 | 16, 17 | impbii 126 | 1 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓)) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1362 ∈ wcel 2167 ⊆ wss 3157 〈cop 3625 {coprab 5923 | 
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-setind 4573 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-v 2765 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-oprab 5926 | 
| This theorem is referenced by: eqoprab2b 5980 | 
| Copyright terms: Public domain | W3C validator |