| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > goeleq12bg | Structured version Visualization version GIF version | ||
| Description: Two "Godel-set of membership" codes for two variables are equal iff the two corresponding variables are equal. (Contributed by AV, 8-Oct-2023.) |
| Ref | Expression |
|---|---|
| goeleq12bg | ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | goel 35913 | . . 3 ⊢ ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼∈𝑔𝐽) = 〈∅, 〈𝐼, 𝐽〉〉) | |
| 2 | goel 35913 | . . 3 ⊢ ((𝑀 ∈ ω ∧ 𝑁 ∈ ω) → (𝑀∈𝑔𝑁) = 〈∅, 〈𝑀, 𝑁〉〉) | |
| 3 | 1, 2 | eqeqan12rd 2777 | . 2 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ 〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉)) |
| 4 | 0ex 5268 | . . . 4 ⊢ ∅ ∈ V | |
| 5 | opex 5443 | . . . 4 ⊢ 〈𝐼, 𝐽〉 ∈ V | |
| 6 | 4, 5 | opth 5456 | . . 3 ⊢ (〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
| 7 | eqid 2762 | . . . . 5 ⊢ ∅ = ∅ | |
| 8 | 7 | biantrur 540 | . . . 4 ⊢ (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
| 9 | opthg 5457 | . . . . 5 ⊢ ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) | |
| 10 | 9 | adantl 487 | . . . 4 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
| 11 | 8, 10 | bitr3id 288 | . . 3 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉) ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
| 12 | 6, 11 | bitrid 286 | . 2 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
| 13 | 3, 12 | bitrd 282 | 1 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∅c0 4282 〈cop 4593 (class class class)co 7416 ωcom 7865 ∈𝑔cgoe 35899 |
| 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-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7419 df-goel 35906 |
| This theorem is used by: satfv0 35924 satfv0fun 35937 |
| Copyright terms: Public domain | W3C validator |