Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqoprab2b | Structured version Visualization version GIF version |
Description: Equivalence of ordered pair abstraction subclass and biconditional. Compare eqopab2b 5442. Usage of this theorem is discouraged because it depends on ax-13 2389. Use the weaker eqoprab2bw 7227 when possible. (Contributed by Mario Carneiro, 4-Jan-2017.) (New usage is discouraged.) |
Ref | Expression |
---|---|
eqoprab2b | ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦∀𝑧(𝜑 ↔ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssoprab2b 7226 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓)) | |
2 | ssoprab2b 7226 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ↔ ∀𝑥∀𝑦∀𝑧(𝜓 → 𝜑)) | |
3 | 1, 2 | anbi12i 628 | . 2 ⊢ (({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ∧ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑}) ↔ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦∀𝑧(𝜓 → 𝜑))) |
4 | eqss 3985 | . 2 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ∧ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑})) | |
5 | 2albiim 1890 | . . . 4 ⊢ (∀𝑦∀𝑧(𝜑 ↔ 𝜓) ↔ (∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑦∀𝑧(𝜓 → 𝜑))) | |
6 | 5 | albii 1819 | . . 3 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 ↔ 𝜓) ↔ ∀𝑥(∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑦∀𝑧(𝜓 → 𝜑))) |
7 | 19.26 1870 | . . 3 ⊢ (∀𝑥(∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑦∀𝑧(𝜓 → 𝜑)) ↔ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦∀𝑧(𝜓 → 𝜑))) | |
8 | 6, 7 | bitri 277 | . 2 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 ↔ 𝜓) ↔ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦∀𝑧(𝜓 → 𝜑))) |
9 | 3, 4, 8 | 3bitr4i 305 | 1 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦∀𝑧(𝜑 ↔ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1534 = wceq 1536 ⊆ wss 3939 {coprab 7160 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-13 2389 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-oprab 7163 |
This theorem is referenced by: oprabbi 35443 |
Copyright terms: Public domain | W3C validator |