Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfdisjw | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for disjoint collection. Version of nfdisj 5031 with a disjoint variable condition, which does not require ax-13 2371. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by Gino Giotto, 26-Jan-2024.) |
Ref | Expression |
---|---|
nfdisjw.1 | ⊢ Ⅎ𝑦𝐴 |
nfdisjw.2 | ⊢ Ⅎ𝑦𝐵 |
Ref | Expression |
---|---|
nfdisjw | ⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdisj2 5020 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) | |
2 | nftru 1812 | . . . . 5 ⊢ Ⅎ𝑥⊤ | |
3 | nfcvd 2905 | . . . . . . 7 ⊢ (⊤ → Ⅎ𝑦𝑥) | |
4 | nfdisjw.1 | . . . . . . . 8 ⊢ Ⅎ𝑦𝐴 | |
5 | 4 | a1i 11 | . . . . . . 7 ⊢ (⊤ → Ⅎ𝑦𝐴) |
6 | 3, 5 | nfeld 2915 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴) |
7 | nfdisjw.2 | . . . . . . . 8 ⊢ Ⅎ𝑦𝐵 | |
8 | 7 | nfcri 2891 | . . . . . . 7 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
9 | 8 | a1i 11 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦 𝑧 ∈ 𝐵) |
10 | 6, 9 | nfand 1905 | . . . . 5 ⊢ (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) |
11 | 2, 10 | nfmodv 2558 | . . . 4 ⊢ (⊤ → Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) |
12 | 11 | mptru 1550 | . . 3 ⊢ Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) |
13 | 12 | nfal 2322 | . 2 ⊢ Ⅎ𝑦∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) |
14 | 1, 13 | nfxfr 1860 | 1 ⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 ∀wal 1541 ⊤wtru 1544 Ⅎwnf 1791 ∈ wcel 2110 ∃*wmo 2537 Ⅎwnfc 2884 Disj wdisj 5018 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-tru 1546 df-ex 1788 df-nf 1792 df-mo 2539 df-cleq 2729 df-clel 2816 df-nfc 2886 df-rmo 3069 df-disj 5019 |
This theorem is referenced by: disjxiun 5050 |
Copyright terms: Public domain | W3C validator |