Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-prmoore Structured version   Visualization version   GIF version

Theorem bj-prmoore 35996
Description: A pair formed of two nested sets is a Moore collection. (Note that in the statement, if 𝐵 is a proper class, we are in the case of bj-snmoore 35994). A direct consequence is {∅, 𝐴} ∈ Moore.

More generally, any nonempty well-ordered chain of sets that is a set is a Moore collection.

We also have the biconditional ((𝐴𝐵) ∈ 𝑉 ({𝐴, 𝐵} ∈ Moore ↔ (𝐴𝐵𝐵𝐴))). (Contributed by BJ, 11-Apr-2024.)

Assertion
Ref Expression
bj-prmoore ((𝐴𝑉𝐴𝐵) → {𝐴, 𝐵} ∈ Moore)

Proof of Theorem bj-prmoore
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 pm3.22 461 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐴𝑉) → (𝐴𝑉𝐵 ∈ V))
21adantrr 716 . . . . . 6 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → (𝐴𝑉𝐵 ∈ V))
3 uniprg 4926 . . . . . 6 ((𝐴𝑉𝐵 ∈ V) → {𝐴, 𝐵} = (𝐴𝐵))
42, 3syl 17 . . . . 5 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴, 𝐵} = (𝐴𝐵))
5 simprr 772 . . . . . 6 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → 𝐴𝐵)
6 ssequn1 4181 . . . . . 6 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐵)
75, 6sylib 217 . . . . 5 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → (𝐴𝐵) = 𝐵)
84, 7eqtrd 2773 . . . 4 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴, 𝐵} = 𝐵)
9 prid2g 4766 . . . . 5 (𝐵 ∈ V → 𝐵 ∈ {𝐴, 𝐵})
109adantr 482 . . . 4 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → 𝐵 ∈ {𝐴, 𝐵})
118, 10eqeltrd 2834 . . 3 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴, 𝐵} ∈ {𝐴, 𝐵})
12 biid 261 . . . . 5 ((𝐴𝑉𝐴𝐵) ↔ (𝐴𝑉𝐴𝐵))
1312bianass 641 . . . 4 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) ↔ ((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵))
14 inteq 4954 . . . . . . . . . 10 (𝑥 = {𝐴} → 𝑥 = {𝐴})
15 intsng 4990 . . . . . . . . . . 11 (𝐴𝑉 {𝐴} = 𝐴)
1615adantl 483 . . . . . . . . . 10 ((𝐵 ∈ V ∧ 𝐴𝑉) → {𝐴} = 𝐴)
1714, 16sylan9eqr 2795 . . . . . . . . 9 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐴}) → 𝑥 = 𝐴)
18 prid1g 4765 . . . . . . . . . . 11 (𝐴𝑉𝐴 ∈ {𝐴, 𝐵})
1918adantl 483 . . . . . . . . . 10 ((𝐵 ∈ V ∧ 𝐴𝑉) → 𝐴 ∈ {𝐴, 𝐵})
2019adantr 482 . . . . . . . . 9 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐴}) → 𝐴 ∈ {𝐴, 𝐵})
2117, 20eqeltrd 2834 . . . . . . . 8 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐴}) → 𝑥 ∈ {𝐴, 𝐵})
2221ex 414 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐴𝑉) → (𝑥 = {𝐴} → 𝑥 ∈ {𝐴, 𝐵}))
2322adantr 482 . . . . . 6 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → (𝑥 = {𝐴} → 𝑥 ∈ {𝐴, 𝐵}))
24 inteq 4954 . . . . . . . . . . 11 (𝑥 = {𝐵} → 𝑥 = {𝐵})
25 intsng 4990 . . . . . . . . . . . 12 (𝐵 ∈ V → {𝐵} = 𝐵)
2625adantr 482 . . . . . . . . . . 11 ((𝐵 ∈ V ∧ 𝐴𝑉) → {𝐵} = 𝐵)
2724, 26sylan9eqr 2795 . . . . . . . . . 10 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐵}) → 𝑥 = 𝐵)
289ad2antrr 725 . . . . . . . . . 10 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐵}) → 𝐵 ∈ {𝐴, 𝐵})
2927, 28eqeltrd 2834 . . . . . . . . 9 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝑥 = {𝐵}) → 𝑥 ∈ {𝐴, 𝐵})
3029ex 414 . . . . . . . 8 ((𝐵 ∈ V ∧ 𝐴𝑉) → (𝑥 = {𝐵} → 𝑥 ∈ {𝐴, 𝐵}))
3130adantr 482 . . . . . . 7 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → (𝑥 = {𝐵} → 𝑥 ∈ {𝐴, 𝐵}))
32 inteq 4954 . . . . . . . . . . 11 (𝑥 = {𝐴, 𝐵} → 𝑥 = {𝐴, 𝐵})
3332adantl 483 . . . . . . . . . 10 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → 𝑥 = {𝐴, 𝐵})
341ad2antrr 725 . . . . . . . . . . 11 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → (𝐴𝑉𝐵 ∈ V))
35 intprg 4986 . . . . . . . . . . 11 ((𝐴𝑉𝐵 ∈ V) → {𝐴, 𝐵} = (𝐴𝐵))
3634, 35syl 17 . . . . . . . . . 10 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → {𝐴, 𝐵} = (𝐴𝐵))
37 df-ss 3966 . . . . . . . . . . . . 13 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐴)
3837biimpi 215 . . . . . . . . . . . 12 (𝐴𝐵 → (𝐴𝐵) = 𝐴)
3938adantl 483 . . . . . . . . . . 11 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → (𝐴𝐵) = 𝐴)
4039adantr 482 . . . . . . . . . 10 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → (𝐴𝐵) = 𝐴)
4133, 36, 403eqtrd 2777 . . . . . . . . 9 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → 𝑥 = 𝐴)
4218ad3antlr 730 . . . . . . . . 9 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → 𝐴 ∈ {𝐴, 𝐵})
4341, 42eqeltrd 2834 . . . . . . . 8 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ 𝑥 = {𝐴, 𝐵}) → 𝑥 ∈ {𝐴, 𝐵})
4443ex 414 . . . . . . 7 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → (𝑥 = {𝐴, 𝐵} → 𝑥 ∈ {𝐴, 𝐵}))
4531, 44jaod 858 . . . . . 6 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → ((𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}) → 𝑥 ∈ {𝐴, 𝐵}))
4623, 45jaod 858 . . . . 5 (((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) → ((𝑥 = {𝐴} ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) → 𝑥 ∈ {𝐴, 𝐵}))
47 sspr 4837 . . . . . 6 (𝑥 ⊆ {𝐴, 𝐵} ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
48 andir 1008 . . . . . . 7 ((((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∧ 𝑥 ≠ ∅) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∧ 𝑥 ≠ ∅) ∨ ((𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}) ∧ 𝑥 ≠ ∅)))
49 andir 1008 . . . . . . . . 9 (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∧ 𝑥 ≠ ∅) ↔ ((𝑥 = ∅ ∧ 𝑥 ≠ ∅) ∨ (𝑥 = {𝐴} ∧ 𝑥 ≠ ∅)))
50 eqneqall 2952 . . . . . . . . . . . 12 (𝑥 = ∅ → (𝑥 ≠ ∅ → ⊥))
5150imp 408 . . . . . . . . . . 11 ((𝑥 = ∅ ∧ 𝑥 ≠ ∅) → ⊥)
52 simpl 484 . . . . . . . . . . 11 ((𝑥 = {𝐴} ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
5351, 52orim12i 908 . . . . . . . . . 10 (((𝑥 = ∅ ∧ 𝑥 ≠ ∅) ∨ (𝑥 = {𝐴} ∧ 𝑥 ≠ ∅)) → (⊥ ∨ 𝑥 = {𝐴}))
54 falim 1559 . . . . . . . . . . 11 (⊥ → 𝑥 = {𝐴})
5554bj-jaoi1 35448 . . . . . . . . . 10 ((⊥ ∨ 𝑥 = {𝐴}) → 𝑥 = {𝐴})
5653, 55syl 17 . . . . . . . . 9 (((𝑥 = ∅ ∧ 𝑥 ≠ ∅) ∨ (𝑥 = {𝐴} ∧ 𝑥 ≠ ∅)) → 𝑥 = {𝐴})
5749, 56sylbi 216 . . . . . . . 8 (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
58 simpl 484 . . . . . . . 8 (((𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}) ∧ 𝑥 ≠ ∅) → (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))
5957, 58orim12i 908 . . . . . . 7 ((((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∧ 𝑥 ≠ ∅) ∨ ((𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}) ∧ 𝑥 ≠ ∅)) → (𝑥 = {𝐴} ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
6048, 59sylbi 216 . . . . . 6 ((((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∧ 𝑥 ≠ ∅) → (𝑥 = {𝐴} ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
6147, 60sylanb 582 . . . . 5 ((𝑥 ⊆ {𝐴, 𝐵} ∧ 𝑥 ≠ ∅) → (𝑥 = {𝐴} ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
6246, 61impel 507 . . . 4 ((((𝐵 ∈ V ∧ 𝐴𝑉) ∧ 𝐴𝐵) ∧ (𝑥 ⊆ {𝐴, 𝐵} ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ {𝐴, 𝐵})
6313, 62sylanb 582 . . 3 (((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) ∧ (𝑥 ⊆ {𝐴, 𝐵} ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ {𝐴, 𝐵})
6411, 63bj-ismooredr2 35991 . 2 ((𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴, 𝐵} ∈ Moore)
65 pm3.22 461 . . . . 5 ((¬ 𝐵 ∈ V ∧ 𝐴𝑉) → (𝐴𝑉 ∧ ¬ 𝐵 ∈ V))
6665adantrr 716 . . . 4 ((¬ 𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → (𝐴𝑉 ∧ ¬ 𝐵 ∈ V))
67 prprc2 4771 . . . . . 6 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴})
6867adantl 483 . . . . 5 ((𝐴𝑉 ∧ ¬ 𝐵 ∈ V) → {𝐴, 𝐵} = {𝐴})
6968eqcomd 2739 . . . 4 ((𝐴𝑉 ∧ ¬ 𝐵 ∈ V) → {𝐴} = {𝐴, 𝐵})
7066, 69syl 17 . . 3 ((¬ 𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴} = {𝐴, 𝐵})
71 bj-snmoore 35994 . . . 4 (𝐴𝑉 → {𝐴} ∈ Moore)
7271ad2antrl 727 . . 3 ((¬ 𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴} ∈ Moore)
7370, 72eqeltrrd 2835 . 2 ((¬ 𝐵 ∈ V ∧ (𝐴𝑉𝐴𝐵)) → {𝐴, 𝐵} ∈ Moore)
7464, 73pm2.61ian 811 1 ((𝐴𝑉𝐴𝐵) → {𝐴, 𝐵} ∈ Moore)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397  wo 846   = wceq 1542  wfal 1554  wcel 2107  wne 2941  Vcvv 3475  cun 3947  cin 3948  wss 3949  c0 4323  {csn 4629  {cpr 4631   cuni 4909   cint 4951  Moorecmoore 35984
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-pw 4605  df-sn 4630  df-pr 4632  df-uni 4910  df-int 4952  df-bj-moore 35985
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator