![]() |
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 35307 | . . 3 ⊢ ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼∈𝑔𝐽) = 〈∅, 〈𝐼, 𝐽〉〉) | |
2 | goel 35307 | . . 3 ⊢ ((𝑀 ∈ ω ∧ 𝑁 ∈ ω) → (𝑀∈𝑔𝑁) = 〈∅, 〈𝑀, 𝑁〉〉) | |
3 | 1, 2 | eqeqan12rd 2755 | . 2 ⊢ (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼∈𝑔𝐽) = (𝑀∈𝑔𝑁) ↔ 〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉)) |
4 | 0ex 5325 | . . . 4 ⊢ ∅ ∈ V | |
5 | opex 5484 | . . . 4 ⊢ 〈𝐼, 𝐽〉 ∈ V | |
6 | 4, 5 | opth 5496 | . . 3 ⊢ (〈∅, 〈𝐼, 𝐽〉〉 = 〈∅, 〈𝑀, 𝑁〉〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
7 | eqid 2740 | . . . . 5 ⊢ ∅ = ∅ | |
8 | 7 | biantrur 530 | . . . 4 ⊢ (〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉 ↔ (∅ = ∅ ∧ 〈𝐼, 𝐽〉 = 〈𝑀, 𝑁〉)) |
9 | opthg 5497 | . . . . 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 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∅c0 4352 〈cop 4654 (class class class)co 7443 ωcom 7897 ∈𝑔cgoe 35293 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5701 df-rel 5702 df-cnv 5703 df-co 5704 df-dm 5705 df-iota 6520 df-fun 6570 df-fv 6576 df-ov 7446 df-goel 35300 |
This theorem is referenced by: satfv0 35318 satfv0fun 35331 |
Copyright terms: Public domain | W3C validator |