Theorem mnutrd 44881

Description: Minimal universes are transitive. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypotheses

Ref	Expression
mnutrd.1	⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
mnutrd.2	⊢ (𝜑 → 𝑈 ∈ 𝑀)

Assertion

Ref	Expression
mnutrd	⊢ (𝜑 → Tr 𝑈)

Distinct variable groups:   𝑈,𝑘,𝑚,𝑛,𝑟,𝑝,𝑙   𝑈,𝑞,𝑘,𝑚,𝑛,𝑝,𝑙

Allowed substitution hints:   𝜑(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝑀(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem mnutrd

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mnutrd.1	. . . . 5 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2		mnutrd.2	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
3	2	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑈 ∈ 𝑀)
4		simprr 784	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑦 ∈ 𝑈)
5		simprl 782	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑦)
6	1, 3, 4, 5	mnutrcld 44880	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈)) → 𝑥 ∈ 𝑈)
7	6	ex 417	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
8	7	alrimivv 1955	. 2 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
9		dftr2 5224	. 2 ⊢ (Tr 𝑈 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑈) → 𝑥 ∈ 𝑈))
10	8, 9	sylibr 237	1 ⊢ (𝜑 → Tr 𝑈)

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1565   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∃wrex 3095   ⊆ wss 3913  𝒫 cpw 4567  ∪ cuni 4876  Tr wtr 5222

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261

This theorem depends on definitions:  df-bi 210  df-an 401  df-3an 1103  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-in 3920  df-ss 3930  df-pw 4569  df-sn 4595  df-uni 4877  df-tr 5223

This theorem is referenced by:  mnugrud  44885