![]() |
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 34952 | . . 3 ⊢ ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼∈𝑔𝐽) = 〈∅, 〈𝐼, 𝐽〉〉) | |
2 | goel 34952 | . . 3 ⊢ ((𝑀 ∈ ω ∧ 𝑁 ∈ ω) → (𝑀∈𝑔𝑁) = 〈∅, 〈𝑀, 𝑁〉〉) | |
3 | 1, 2 | eqeqan12rd 2743 | . 2 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ 〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉)) |
4 | 0ex 5302 | . . . 4 ⊢ ∅ ∈ V | |
5 | opex 5461 | . . . 4 ⊢ 〈𝐼, 𝐽〉 ∈ V | |
6 | 4, 5 | opth 5473 | . . 3 ⊢ (〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
7 | eqid 2728 | . . . . 5 ⊢ ∅ = ∅ | |
8 | 7 | biantrur 530 | . . . 4 ⊢ (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
9 | opthg 5474 | . . . . 5 ⊢ ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) | |
10 | 9 | adantl 481 | . . . 4 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
11 | 8, 10 | bitr3id 285 | . . 3 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉) ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
12 | 6, 11 | bitrid 283 | . 2 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉 ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
13 | 3, 12 | bitrd 279 | 1 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ (𝐼 = 𝑀 ∧ 𝐽 = 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∅c0 4319 〈cop 4631 (class class class)co 7415 ωcom 7865 ∈𝑔cgoe 34938 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5294 ax-nul 5301 ax-pr 5424 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ral 3058 df-rex 3067 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4320 df-if 4526 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4905 df-br 5144 df-opab 5206 df-mpt 5227 df-id 5571 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-iota 6495 df-fun 6545 df-fv 6551 df-ov 7418 df-goel 34945 |
This theorem is referenced by: satfv0 34963 satfv0fun 34976 |
Copyright terms: Public domain | W3C validator |